CGAL users discussion list

[Monique Teillaud <>]

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

Le 05/11/12 01:31, Michael Kalygin a écrit :
> Greetings!
>
> I'm very new to CGAL library and it seems very big to be intuitive for a new
> user.
>
> I'm trying to build Delaunay triangulation on a sphere. Input data
> represented as points on a sphere with (lat, lon) coordinates. I have read
> two articles about this topic:
>
> 1. Robust and Efficient Delaunay triangulations of points on or close to a
> sphere
> Manuel Caroli — Pedro M. M. de Castro — Sébastien Loriot — Monique Teillaud
> — Camille Wormser, 2009;
> 2. The Space of Spheres, a Geometric Tool to Unify Duality Results on
> Voronoi Diagrams
> Olivier Devillers, Stefan Meiser, Monique Teillaud, 1992.
>
> And I feel that I understand the approach in these articles (primarily in
> the first article). But I really lost in CGAL library, it's so huge and the
> documentation is enormous. I've tried a simple example with 2D Delaunay
> triangulation and it worked perfectly. But I can't imagine what to do with a
> sphere. How to repeat the algorithm in the first article using CGAL library?
>
> Could you help me with this task?
>
> Thanks!
>
> Best regards,
> Michael.
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Triangulation-on-a-sphere-using-CGAL-tp4656139.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.


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