Subject: CGAL users discussion list
List archive
- From: ju21 <>
- To:
- Subject: [cgal-discuss] Re: About 3D Triangulation Data Structure
- Date: Mon, 6 Aug 2012 07:33:00 -0700 (PDT)
Mariette Yvinec wrote
>
> The answer is no, you won't get the same thing ;
>
> The All_cells_iterator of a triangulation traverse
> all the cells of the triangulation including
> the infinite ones.
>
> The tetrahedra that belong to the mesh is only a subset
> of the the set of finite cells in the triangulation.
>
> --
> Mariette Yvinec
> Geometrica project team
> INRIA Sophia-Antipolis
>
>
Ok thank you that could explain the strange results.
So if I wanna built the same thing, I have to use a *Finite_cells_iterators*
? And maybe check if the vertices are finite ones ? Or I'm wrong again ?
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/About-3D-Triangulation-Data-Structure-tp4655673p4655676.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] About 3D Triangulation Data Structure, ju21, 08/06/2012
- Re: [cgal-discuss] About 3D Triangulation Data Structure, Mariette Yvinec, 08/06/2012
- [cgal-discuss] Re: About 3D Triangulation Data Structure, ju21, 08/06/2012
- Re: [cgal-discuss] About 3D Triangulation Data Structure, Mariette Yvinec, 08/06/2012
Archive powered by MHonArc 2.6.18.