CGAL users discussion list

[Monique Teillaud <>]

Joao Dinis wrote:
> Dear Monique,
>
> thanks for your reply.
> Reading the report you post about shed some light on the subject.
> So it seams, building the 3D convex hull is not the CGAL way of
> computing the Delaunay triangulation of points on (or near) the sphere,
> but it is best to generalize the incremental algorithm of computing the
> 2D Delaunay triangulation.

Dear Joao,

> I think it is fair to assume that one of the algorithms mentioned on the
> report will find their way into the CGAL library, am I right?

when manpower allows it...

In the meanwhile, as you can read, 3D Delaunay triangulations give quite 
a good alternative.

Best regards,
        Monique Teillaud


> On Sun, 2010-02-14 at 16:13 +0100, Monique Teillaud wrote:
> > Joao Dinis wrote:
> > > Hi all,
> > >
> > > I've found intriguing run times while computing 3D convex hulls of sites
> > > on the surface of a sphere.
> > Dear Joao,
> >
> > you may be interested by the following preprint, which reports on 
> > experiments for points on a sphere:
> > http://hal.inria.fr/inria-00405478/
> >
> > Best regards,

--
Monique Teillaud
INRIA Sophia Antipolis - Méditerranée
http://www.inria.fr/sophia/members/Monique.Teillaud/