CGAL users discussion list

[alef <>]

Thank you Sebastien for your answer.

Actually, I tried my code alse with segment primitives instead of triangle
primitives but it appears that every polyhedron in the tree has its own
segments so I get again multiple identical solutions. Of course, I can write
a function to check how many intersection are unique but I wondered if there
are any approaches in CGAL and where I can find them.

In the end, I would like to consider a triangulation of a domain in R^3 and
say to get its intersection with a plane. It is likely that the plane is
going to intersect with a ridge and this ridge is possibly common to many
polyhedra. Hence I would like to get only one intersection because the
common ridge can be uniquely defined.

Thank you,

Adrien



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Re-AABB-tree-all-intersections-Multiple-identical-intersections-tp4656295p4656306.html
Sent from the cgal-discuss mailing list archive at Nabble.com.