Constructing Delaunay Triangulations along Space-Filling Curves, Proc. 17th European Symposium on Algorithms, pp.119-130, 2009. ,
DOI : 10.1007/978-3-642-04128-0_11
URL : http://repository.tue.nl/668788
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended, Algorithmica, vol.43, issue.3, 2011. ,
DOI : 10.1007/s00453-010-9430-0
Splitting a Delaunay Triangulation in Linear Time, Algorithmica, vol.34, issue.1, pp.39-46, 2002. ,
DOI : 10.1007/s00453-002-0939-8
URL : https://hal.archives-ouvertes.fr/hal-01179401
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time, SIAM Journal on Computing, vol.28, issue.2, pp.471-486, 1998. ,
DOI : 10.1137/S0097539795285916
Spatial sorting, CGAL User and Reference Manual. CGAL Editorial Board, 2011. ,
THE DELAUNAY HIERARCHY, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.163-180, 2002. ,
DOI : 10.1142/S0129054102001035
URL : https://hal.archives-ouvertes.fr/inria-00166711
Delaunay triangulation of imprecise points, preprocess and actually get a fast query time, Research Report, vol.7299 ,
URL : https://hal.archives-ouvertes.fr/hal-00850583
Delaunay triangulation of imprecise points in linear time after preprocessing, Computational Geometry, vol.43, issue.3, pp.234-242, 2009. ,
DOI : 10.1016/j.comgeo.2008.12.007
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator ,
DOI : 10.1007/BFb0014497