Subject: CGAL users discussion list
List archive
- From: "Chaman Singh Verma" <>
- To:
- Subject: Re: [cgal-discuss] Output from Delaunay Triangulation.
- Date: Mon, 1 Dec 2008 04:46:42 +0530
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version :content-type:references; b=mhsv4mcR/MKNJG3JX0Gm3fQqvbF8/a9wHu8fAlSvPAwb/O1hFTdkMfB77FNv9/WyKU r6bRIaGKkx7FRzrN5DBCMt7bkf1uRkbu6Jbg7gheTUg6C6/Jx7QWyHjXGuS9l6Un8v62 2RhHs8kJic+4vK8k5UZydebt3HoNvazZLEvVs=
On Sun, Nov 30, 2008 at 9:02 PM, Sylvain Pion <> wrote:
It is up to you. There is no internal ID for vertices in CGAL.Chaman Singh Verma wrote:
I have list of 2D/3D coordinates and interested in Delaunay triangulation as follows.
#VertexID X Y Z
1 x1 y1 z1
2. x2 y2 z2
3
#Triangles in 2D
1 T1n1 T1n2 T1n3
2 T2n1 T2n2 T3n3
3.
How interger ID are assigned to the vertices ?
You can build one by std::map-ing Vertex_handles to integers for example.
Fell free to have a look at the implementation of operator<<
to get some inspiration.
--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/
Hello,
I was looking for one simple example that uses Vertex_handles with Convex hull calculations. Where can I find that ?
thanks.
csv
- Re: [cgal-discuss] Output from Delaunay Triangulation., Chaman Singh Verma, 12/01/2008
Archive powered by MHonArc 2.6.16.