CGAL users discussion list

[Pedro Machado Manhães de Castro <>]

There is a way to accelerate even more:

You can use a 2D regular triangulation.

You might find interesting reading this paper:

Manuel Caroli, Pedro M. M. de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, and Camille Wormser. Robust and Efficient Delaunay Triangulations of Points on or Close to a Sphere. In 9th International Symposium on Experimental Algorithms, volume 6049 of Lecture Notes in Computer Science, pages 462-473, 2010.

Unfortunately, our implementation is still experimental, and isn't yet in CGAL.

As people sometimes ask for it, we hope to provide it in a not too far future.

Cheers,

Pedro

On Fri, Nov 25, 2011 at 9:07 AM, Joao Dinis <> wrote:

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

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss