CGAL users discussion list

[Guillaume Damiand <>]

Le 19/06/2014 10:24, Pranav a écrit :
> 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/.

You means pair of faces of t and p having the same geometry ?

If yes the function sew3_same_facets() defined in the class 
Linear_cell_complex can be used.

> 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.


--
===================================================================
Guillaume DAMIAND

CNRS - LIRIS UMR 5205
Université Claude Bernard
Bâtiment Nautibus (710)
43 Boulevard du 11 Novembre 1918
69622 Villeurbanne Cedex (France)
-------------------------------------------------------------------
Tél: +33 (0)4.72.43.26.62                 Fax: +33 (0)4.72.43.15.36
Mail: 

Web: http://liris.cnrs.fr/guillaume.damiand/
===================================================================