CGAL users discussion list

[Zohar <>]

Maybe there's a better way, but I would construct a AABB tree for the
polyhedron triangles. The I would find the closest triangle to the query
point and use Kernel::BoundedSide_2() to determine if the point is on the
bounded side of the triangle.

--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Determine-if-a-point-is-interior-or-exterior-to-a-Polyhedron-3-tp4466730p4468357.html
Sent from the cgal-discuss mailing list archive at Nabble.com.