CGAL users discussion list

[Zohar <>]

I think this linear program is only for illustrating the interface, and not
a practical example. I'm not sure why it's limited only for convex poly.
Anyway you could simply iterate all the faces and check if the point is on
the oriented negative side. But consider the complexity. You'll have to
iterate all the faces. On the other hand using a kdtree costs you
approximately logn. I think Andreas solution is the fastest suggestion so
far:

http://cgal-discuss.949826.n4.nabble.com/Surface-remeshing-using-mesh-generation-td4471479.html

although I didn't have the time to try it yet.

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