CGAL users discussion list

[Zohar <>]

Laurent,

I updated my post, and you probably didn't see it because you don't use the
forum interface, so here it is:

"Maybe there's a better way, but I would construct a AABB tree for the
polyhedron triangles. Then I would find the closest triangle to the query
point and use Kernel::HasOnNegativeSide_3() (~positive) on the triangle's
Kernel::ConstructSupportingPlane_3().

You should also check the locate() of Nef_polyhedron_3. "

Do you see a flaw in my method (point right to hyperplane)?
Don't you think it's more robust then the negligible probability?

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