std::vector<std::vector<int>> VV;
    igl::adjacency_list(F, VV);
    // Initialize structures. Not sure what the target set is good for.
    int a = 0, b = 0;
    double distance = 0;
    std::set<int> targets;
    for(int i=0; i<V.rows(); ++i)
      targets.insert(i);
    // Loop through all verts.
    for(int i=0; i<V.rows(); ++i){
      // Compute dijkstra to all other nodes
      Eigen::VectorXd min, prev;
      targets.erase(i);
      igl::dijkstra(i, targets, VV, min, prev);
      // Find maximal distance
      for(auto j : targets){
        if(min(j) <= distance || isinf(min(j))) continue;
        distance = min(j);
        a = i; b = j;
      }
    }
    // Store.
    std::cout << "Fixpoints: " << a << "," << b << " (" << distance << ")\n";
    fixed_UV_indices = Eigen::VectorXi::Zero(2);
    fixed_UV_positions = Eigen::MatrixXd::Zero(2, 2);
    fixed_UV_indices(0) = a;
    fixed_UV_indices(1) = b;
    fixed_UV_positions(0, 0) = -distance/2;
    fixed_UV_positions(1, 0) = +distance/2;