CGAL users discussion list

[gmgunderground <>]

I'm new of this forum, so Hi to every one.
I have created a list/array of 3D segments by intersecting a 3D object with
a plane using 
*tree->all_intersections(plane_query, std::back_inserter(intersections));*
These segments (that are sparse) if connected creates every time a closed
loop (sometimes more loops, imagine to cut with a plane a sphere that has
inside another sphere). Is possible to create something like
*List<List&lt;Segment>> * a list of loops and every loop the segments
ordered by adjacent ?
I have just resolved this problem making a "for cicle" for every segments
and finding the adjacent and when I find that the next is the first it means
I have closed one loop. What I want to know is if there is a more efficent
way to solve the problem that is very heavy in terms of time. 

Best regards to everyone
GMG



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Adjacent-3D-Segments-ordering-tp4659233.html
Sent from the cgal-discuss mailing list archive at Nabble.com.