Subject: CGAL users discussion list
List archive
- From: Sylvain Pion <>
- To:
- Subject: Re: [cgal-discuss] Delaunay_triangulation_3
- Date: Mon, 23 Nov 2009 13:05:39 +0100
- Organization: INRIA
Tan Viet Anh TRUONG wrote:
Hi all,
I'm using CGAL::Delaunay_triangulation_3 to make 3d-triangulations from set of points. I tried with 4 points first:
Vertex_handle v0 = T.insert(Point(0,0,0));
Vertex_handle v1 = T.insert(Point(1,0,0));
Vertex_handle v2 = T.insert(Point(0,1,0));
Vertex_handle v3 = T.insert(Point(0,0,1));
Normally we have only a tedrahedron with these four points, but when i printed the result, I had:
3
4
0 0 0
1 0 0
0 1 0
0 0 1
5
0 1 3 4
1 2 3 4
2 0 3 4
2 1 0 4
1 3 2 0
1 2 3 4
2 0 3 4
0 1 3 4
0 2 1 4
2 3 0 1
I didn't understand what is "0 1 3 4" for example and why we have so much such sets.
You have ideas for this?
That is because there is an "infinite" vertex, together with
"infinite" cells.
--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/
- [cgal-discuss] Delaunay_triangulation_3, Tan Viet Anh TRUONG, 11/23/2009
- Re: [cgal-discuss] Delaunay_triangulation_3, Monique Teillaud, 11/23/2009
- Re: [cgal-discuss] Delaunay_triangulation_3, Sylvain Pion, 11/23/2009
Archive powered by MHonArc 2.6.16.