CGAL users discussion list

[Mariette Yvinec <>]

The algorithm  coded in CGAL for the regular triangulation is the well known incremental algorithm.
You may look into this old paper  and the ref therein

@inproceedings{Aurenhammer:1991:SOR:109648.109664,
 author = {Aurenhammer, Franz and Schwarzkopf, Otfried},
 title = {A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams},
 booktitle = {Proceedings of the seventh annual symposium on Computational geometry},
 series = {SCG '91},
 year = {1991},
 isbn = {0-89791-426-0},
 location = {North Conway, New Hampshire, USA},
 pages = {142--151},
 numpages = {10},
 url = "{http://doi.acm.org/10.1145/109648.109664},
 doi = {10.1145/109648.109664},
 acmid = {109664},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

Le 26/07/13 09:56, arno a écrit :

hello everyone:
       Could anyone tell me which paper is the references of the Regular Triangulations in cgal? I want to implement this algorithm by myself. Thank a lot!

-- 
Mariette Yvinec
Geometrica project team
INRIA  Sophia-Antipolis