Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Data structure - Triangulation

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Data structure - Triangulation


Chronological Thread 
  • From: "Laurent Rineau (GeometryFactory)" <>
  • To:
  • Subject: Re: [cgal-discuss] Data structure - Triangulation
  • Date: Sun, 4 Oct 2009 19:05:50 +0200
  • Organization: GeometryFactory

Le dimanche 04 octobre 2009 13:39:02,

a écrit :
> Hello,
>
> I just begun to use CGAL and so my question is quite basic, sorry.
> I have compile an example to create a triangulation and print it. The
> output file looks like the example below.
> It there somewhere in the documentation a description of this data
> structure? The first lines are obviously dimension, #nodes , coordinates
> but then elements. But why do I get so many elements? why node5 appears?
> Could you please explain me this format? Thank you.

The vertex numbered 0 is the infinite vertex, which does not carry
coordinates
(it is only a combinatorial vertex). If you only want finite cells, you can
ignore all the cells that are incident to the vertex #0.

--
Laurent Rineau, PhD
Release Manager of the CGAL Project
http://www.cgal.org/
R&D Engineer at GeometryFactory
http://www.geometryfactory.com/



Archive powered by MHonArc 2.6.16.

Top of Page