CGAL users discussion list

[gg++ <>]

Regarding CGAL's AABB tree:

I know that CGAL explicitly states that no function is provided to compute
the first intersected primitive with respect to the source of a ray query,
i.e. the first triangle a ray hits in space. However, this is exactly what I
need to do. My current workaround is to construct the intersection objects
and intersected primitive id's and for each intersection, I compute the
distance to the source of the ray and return the closest primitive. 

Is there a better way to accomplish the same task using CGAL? Is there
another set of libraries compatible with CGAL's ray/triangle classes that
provides a function similar to the one I am looking for?

Thank you,

Grant



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Spatial-Searching-and-Sorting-First-Intersected-Primitive-tp4656090.html
Sent from the cgal-discuss mailing list archive at Nabble.com.