CGAL users discussion list

[Zohar <>]

So far I found a simple algorithm that calculates the matrix of geodesic
distances on the mesh between all the vertices, and from it extracts the
farthest point sampling. One draw back of the algorithm is that the distance
matrix is a dense NxN matrix, so it only applicable for small models. I
could though overcome this by using a multi-res mesh, or perform the
algorithm up to some radius.

Any other ideas?

--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Farthest-point-sampling-on-a-polyhedron-tp4655217p4655290.html
Sent from the cgal-discuss mailing list archive at Nabble.com.