CGAL users discussion list

[Илья Палачев <>]

Hi,

 

There is a vector of 3D points, and the hull of them is constucted:

 

std::vector<Point_3> points = ...;

Polyhedron_3 hull;

CGAL::convex_hull_3(points.begin(), points.end(), hull);

 

After that I need to know which vertex in hull correspond to points[i] and vice versa.

 

Is there any API to set the initial ID of point/vertex before the construction of hull and then to get it after the construction?

 

The staightforward method is to look through the vector of vertices and find the closest vertex to the given point.

But this method needs O(N ^ 2) of time, or O(N * log(N)) if we do something like preliminary sorting the array of hull vertices in the lexicographical order.

 

But is there any natural way to do that?

 

--

Best regards,

Ilya Palachev