CGAL users discussion list

[Guillaume Damiand <>]

This is a kind of boolean operations.

You need to add the two polyhedron_3 p1 and p2 into a same LCC.

Then you have to detect all the intersections between p1 and p2; and use 
insertion operations to insert all the intersection in the two parts in 
the lcc. When this is done, you can use sew operation.

This is a complex algorithm; you need to read some papers on boolean 
operations, and you can have a look at the Polyhedron_demo which 
proposes a plugins to do boolean operations.

Guillaume


Le 04/04/2013 19:11, sdg a écrit :
> I hope I can combine two polyhedron_3 into a single polyhedron_3 and keep the
> co-planar like pic.
>
> <http://cgal-discuss.949826.n4.nabble.com/file/n4657122/Untitled.png>
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/union-two-polyhedron-3-tp4657092p4657122.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/
===================================================================

Attachment: smime.p7s
Description: Signature cryptographique S/MIME