CGAL users discussion list

[Bernd Gaertner <>]

Atul Thakur wrote:
> I generated the Polyhedron by creating convex hull of my geometry as 
> follows.

If the polytope is convex, you can indeed use Polytope_distance_d. For 
this, you don't even need the polytope itself, you just need a set of 
points, and the package will compute the closest point in their convex 
hull from a given point (or polytope). If the point is on or inside the 
hull, you also get a subset of at most 4 points whose convex hull 
contains it, so you can test "how interior" the point is. Feel free to 
contact me in private about details (I'm one of the authors of the 
Polytope_distance_d package).

Best,
Bernd Gaertner.