CGAL users discussion list

[Pranav <>]

Given a set of darts associated with a tetrahedron(3-cell) /t/ and a set of
darts representing a polyhedron(in combinatorial map representation) /p/. I
want to determine set of common 2-cells(or faces) between /t/ and /p/. 

It seems to be a standard /set-intersection/ problem between 2 sets of
darts(i.e., *Set 1*: Darts representing faces of /t/, *Set 2*: Darts
representing faces of /p/).

I would like to know if there is any method already available in CGAL for
solving this problem or should I apply brute-force approach for comparing
all possible pairs of faces(represented by darts) of /p/ and /t/? 




--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Intersection-on-set-of-darts-tp4659464.html
Sent from the cgal-discuss mailing list archive at Nabble.com.