Subject: CGAL users discussion list
List archive
- From: Joao Dinis <>
- To: "" <>
- Subject: Re: [cgal-discuss] Delaunay 3D triangulation of points on the unit sphere
- Date: Fri, 25 Nov 2011 12:07:46 +0000
Hi Pedro,
your suggestion solved it. Thanks.
And it is now clear to me why a single extra point at the origin wasn't
working before. Of course, that extra point was mixed in the spatial
sorting, precluding the intended effect.
Now the run-times of Delaunay triangulation are a bit faster (1.1x to
1.3x faster, faster for larger data sets) than to the simple triang,
with the the former consuming roughly 2/3 of the memory than of the
later.
So, it seems that, in general, it is preferable to use the CGAL Delaunay
triang. than the simple 3D triang., for the sphere.
What's your opinion?
Best regards,
Joao Dinis
- [cgal-discuss] Delaunay 3D triangulation of points on the unit sphere, Joao Dinis, 11/25/2011
- Re: [cgal-discuss] Delaunay 3D triangulation of points on the unit sphere, Pedro Machado Manhães de Castro, 11/25/2011
- Re: [cgal-discuss] Delaunay 3D triangulation of points on the unit sphere, Monique Teillaud, 11/25/2011
- Re: [cgal-discuss] Delaunay 3D triangulation of points on the unit sphere, Joao Dinis, 11/25/2011
- Re: [cgal-discuss] Delaunay 3D triangulation of points on the unit sphere, Pedro Machado Manhães de Castro, 11/25/2011
- Re: [cgal-discuss] Delaunay 3D triangulation of points on the unit sphere, Joao Dinis, 11/25/2011
Archive powered by MHonArc 2.6.16.