A. Aggarwal, B. Chazelle, and L. J. Guibas, Colm Ó'Dúnlaing, and Chee- Keng Yap. Parallel computational geometry, Algorithmica, vol.3, pp.1-4293, 1988.

G. Selim, K. A. Akl, and . Lyons, Parallel computational geometry, 1993.

N. Amenta, S. Choi, and G. Rote, Incremental constructions con BRIO, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.211-219, 2003.
DOI : 10.1145/777792.777824

K. Daniel, G. E. Blandford, C. Blelloch, and . Kadow, Engineering a compact parallel Delaunay algorithm in 3D, SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry, pp.292-300, 2006.

E. Guy, J. C. Blelloch, G. L. Hardwick, D. Miller, and . Talmor, Design and implementation of a practical parallel Delaunay algorithm, Algorithmica, vol.24, issue.3, pp.243-269, 1999.

J. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec, Triangulations in CGAL, Computational Geometry, vol.22, issue.1-3, pp.5-19, 2002.
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408

A. Bowyer, Computing Dirichlet tessellations, The Computer Journal, vol.24, issue.2, pp.162-166, 1981.
DOI : 10.1093/comjnl/24.2.162

A. Liu and C. , Parallel algorithms for geometric problems, 1980.

P. Cignoni, D. Laforenza, C. Montani, R. Perego, and R. Scopigno, Evaluation of parallelization strategies for an incremental Delaunay triangulator in e3, Concurrency: Practice and Experience, pp.61-80, 1995.
DOI : 10.1002/cpe.4330070106

P. Cignoni, C. Montani, R. Perego, and R. Scopigno, Parallel 3D Delaunay Triangulation, Computer Graphics Forum, vol.12, issue.3, pp.129-142, 1993.
DOI : 10.1111/1467-8659.1230129

L. Kenneth, P. W. Clarkson, and . Shor, Applications of random sampling in computational geometry, ii, Discrete Comput. Geom, vol.4, issue.5, pp.387-421, 1989.

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

M. Hoffmann, L. Kettner, S. Pion, and R. Wein, STL extensions for CGAL, CGAL User and Reference Manual. 3.3 edition, 2007.

S. Hornus and J. Boissonnat, An efficient implementation of Delaunay triangulations in medium dimensions, Research Report, vol.6743, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00343188

J. Kohout, I. Kolingerová, and J. ?ára, Parallel Delaunay triangulation in E2 and E3 for computers with shared memory, Parallel Computing, vol.31, issue.5, pp.491-522, 2005.
DOI : 10.1016/j.parco.2005.02.010

S. Lee, C. Park, and C. Park, AN IMPROVED PARALLEL ALGORITHM FOR DELAUNAY TRIANGULATION ON DISTRIBUTED MEMORY PARALLEL COMPUTERS, Parallel Processing Letters, vol.11, issue.02n03, pp.341-352, 2001.
DOI : 10.1142/S0129626401000634

Y. Liu and J. Snoeyink, A comparison of five implementations of 3D delaunay tessellation, Combinatorial and Computational Geometry, pp.439-458

J. Reinders, Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism, 2007.

J. R. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.86-95, 1998.
DOI : 10.1145/276884.276894
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.2243

J. Singler and B. Kosnik, The GNU libstdc++ parallel mode, Proceedings of the 1st international workshop on Multicore software engineering , IWMSE '08, 2008.
DOI : 10.1145/1370082.1370089

J. Singler, P. Sanders, and F. Putze, MCSTL: The Multi-core Standard Template Library, Euro-Par '07: Proceedings of the thirteenth European Conference on Parallel and Distributed Computing, pp.682-694, 2007.
DOI : 10.1007/978-3-540-74466-5_72
URL : http://algo2.iti.kit.edu/singler/mcstl/ppopp040-singler.pdf

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

A. Zomorodian and H. Edelsbrunner, FAST SOFTWARE FOR BOX INTERSECTIONS, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex, pp.143-172, 2002.
DOI : 10.1142/S0218195902000785
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.5311

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399