CGAL users discussion list

["Thomas Zangl - Home" <>]

Am Tue, 17 Jul 2007 21:10:51 +0200 (CEST), schrieb 
<>:

Hi!

>If you can, you could program a flooding algorithm: start with a triangle
>T of the surface you are looking for, and for each edge e of T, find among
>the other triangles incident to e the one that also belongs to the
>surface. Then iterate on the new edges of your patch.
>[it may also be much less expensive than checking all the faces of your 3D
>triangulation]

Is P.make_triangle ( Point p1, Point p2, Point p3) the
appropriate method to insert the triangles? 

>If you cannot, Polyhedron_3 is not an adequate data structure.

I am not yet sure, but I know that I need to use anything else then.
In 2D I was able to guarentee that it was a closed polygon. 

Best regards,
-- 
----------------------------------------------------------------
,yours Thomas Zangl, Bakk.rer.soc.oec. - 

 -
- Freelancer - IT Consulting & Software Development -
- Student of Software Development-Economy (Master) -