K. Buchin, 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

D. R. Chand and S. S. Kapur, An Algorithm for Convex Polytopes, Journal of the ACM, vol.17, issue.1, pp.78-86, 1970.
DOI : 10.1145/321556.321564

B. Chazelle, An optimal convex hull algorithm in any fixed dimension, Discrete & Computational Geometry, vol.16, issue.4, pp.377-409, 1993.
DOI : 10.1007/BF02573985

B. Chazelle, Application challenges to computational geometry: CG impact task force report, Advances in Discrete and Computational Geometry, pp.407-463, 1999.

L. P. Chew, Building Voronoi diagrams for convex polygons in linear expected time, Dept. Math. Comput. Sci, 1990.

K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, vol.1, issue.5, pp.387-421, 1989.
DOI : 10.1007/BF02187740

P. Machado-manhães-de-castro and O. Devillers, Simple and efficient distribution-sensitive point location, in triangulations, In Workshop on Algorithm Engineering and Experiments, pp.127-138, 2011.

O. Devillers, 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

O. Devillers, ON DELETION IN DELAUNAY TRIANGULATIONS, International Journal of Computational Geometry & Applications, vol.12, issue.03, pp.193-205, 2002.
DOI : 10.1142/S0218195902000815
URL : https://hal.archives-ouvertes.fr/hal-01179435

O. Devillers, Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization, Computational Geometry, vol.44, issue.3, pp.169-177, 2011.
DOI : 10.1016/j.comgeo.2010.10.001
URL : https://hal.archives-ouvertes.fr/inria-00560379

O. Devillers, J. Erickson, and X. Goaoc, Empty-ellipse graphs, Proc. 19th ACM-SIAM Sympos. Discrete Algorithms, pp.1249-1256, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00176204

O. Devillers and S. Pion, Efficient exact geometric predicates for Delaunay triangulations, Proc. 5th Workshop Algorithm Eng. Exper, pp.37-44, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00344517

O. Devillers, S. Pion, and M. Teillaud, WALKING IN A TRIANGULATION, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.181-199, 2002.
DOI : 10.1142/S0129054102001047
URL : https://hal.archives-ouvertes.fr/inria-00344519

O. Devillers and M. Teillaud, Perturbations for Delaunay and weighted Delaunay 3D triangulations, Computational Geometry, vol.44, issue.3, pp.160-168, 2011.
DOI : 10.1016/j.comgeo.2010.09.010
URL : https://hal.archives-ouvertes.fr/inria-00560388

L. Devroye, E. Peter-mücke, and B. Zhu, A Note on Point Location in Delaunay Triangulations of Random Points, Algorithmica, vol.22, issue.4, pp.477-482, 1998.
DOI : 10.1007/PL00009234

R. Dwyer, The expected number of k-faces of a Voronoi diagram. Internat, J. Comput. Math, vol.26, issue.5, pp.13-21, 1993.

H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics, vol.9, issue.1, pp.66-104, 1990.
DOI : 10.1145/77635.77639

I. Emiris and J. Canny, A General Approach to Removing Degeneracies, SIAM Journal on Computing, vol.24, issue.3, pp.650-664, 1995.
DOI : 10.1137/S0097539792235918

J. Erickson, Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?, Discrete & Computational Geometry, vol.33, issue.1, pp.83-115, 2005.
DOI : 10.1007/s00454-004-1089-3
URL : http://arxiv.org/pdf/cs/0110030v1.pdf

S. J. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, vol.14, issue.1-4, pp.153-174, 1987.
DOI : 10.1007/BF01840357

C. O. Frederick, Y. C. Wong, and F. W. Edge, Two-dimensional automatic mesh generation for structural analysis, International Journal for Numerical Methods in Engineering, vol.2, issue.1, pp.133-144, 1970.
DOI : 10.1002/nme.1620020112

S. Funke, K. Mehlhorn, and S. Näher, Structural filtering: a paradigm for efficient and exact geometric programs, Computational Geometry, vol.31, issue.3, pp.179-194, 2005.
DOI : 10.1016/j.comgeo.2004.12.007

J. Mordecai, H. Golin, and . Na, The probabilistic complexity of the voronoi diagram of points on a polyhedron, Proc. 18th Annual Symposium on Computational Geometry, 2002.

J. Mordecai, H. Golin, and . Na, On the average complexity of 3d-voronoi diagrams of random points on convex polytopes, Computational Geometry: Theory and Applications, vol.25, pp.197-231, 2003.

L. J. Guibas, D. E. Knuth, and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica, vol.134, issue.1-6, pp.381-413, 1992.
DOI : 10.1007/BF01758770

M. Held, VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments, S0925772101000037. [37] C. L. Lawson. Software for C 1 surface interpolation, pp.95-123, 2001.
DOI : 10.1016/S0925-7721(01)00003-7

D. T. Lee, Proximity and reachability in the plane, 1978.

P. Ernst, I. Mücke, B. Saias, and . Zhu, Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations

V. Ph and . Nguyen, Automatic mesh generation with tetrahedron elements, Internat. J. Numer. Methods Eng, vol.18, pp.273-289, 1982.

R. Seidel, The Nature and Meaning of Perturbations in Geometric Computing, Discrete & Computational Geometry, vol.19, issue.1, pp.1-17, 1998.
DOI : 10.1007/PL00009330

J. R. Shewchuk, Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates, Discrete & Computational Geometry, vol.18, issue.3, pp.305-363, 1997.
DOI : 10.1007/PL00009321

K. Sugihara and M. Iri, Construction of the Voronoi diagram for 'one million' generators in singleprecision arithmetic, Proc. IEEE, pp.1471-1484, 1992.

D. F. Watson, Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, The Computer Journal, vol.24, issue.2, pp.167-172, 1981.
DOI : 10.1093/comjnl/24.2.167

C. K. Yap and T. Dubé, THE EXACT COMPUTATION PARADIGM, Computing in Euclidean Geometry of Lecture Notes Series on Computing, pp.452-492, 1995.
DOI : 10.1142/9789812831699_0011