CGAL users discussion list

[Monique Teillaud <>]

Hi,

unfortunately, not yet. The code is working, it is very fast, but there 
are a few minor details to tune, and most of all it is not yet 
documented...

Best,
--
Monique Teillaud
http://www.inria.fr/sophia/members/Monique.Teillaud/
INRIA Sophia Antipolis - Méditerranée
Institut National de Recherche en Informatique et Automatique

Le 20/06/13 21:33, isscandar a écrit :
> teillaud wrote
> > Hi,
> >
> > We are currently working on the implementation of [1] for CGAL.
> >
> > What you can do in the meanwhile is either use CGAL convex hulls or CGAL
> > 3D Delaunay triangulations (the result will be obtained by traversing
> > finite facets of cells that are incident to the infinite vertex).
> >
> > Best regards,
> >         Monique Teillaud
>
> Hello,
> I am interested, as the OP, in the Delaunay triangulation of points lying on
> a sphere.
> Are the algorithms described in         
> Caroli, M., De Castro, P. M., Loriot, S., Rouiller, O., Teillaud, M., &
> Wormser, C. (2009). Robust and Efficient Delaunay triangulations of points on
> or close to a sphere <http://hal.inria.fr/inria-00405478/>   now available
> in CGAL?
>
> Thank you.
> Best regards.
>
> Alessandro
>
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Triangulation-on-a-sphere-using-CGAL-tp4656139p4657688.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.