A. Aggarwal, B. Chazelle, and L. J. Guibas, Colm´OColm´ Colm´O'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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

H. F. Vicente, D. L. Batista, S. Millman, J. Pion, and . Singler, Parallel geometric algorithms for multi-core computers, Research Report, vol.6749, 2008.

K. Daniel, G. E. Blandford, C. Blelloch, and . Kadow, Engineering a compact parallel Delaunay algorithm in 3D, Proc. 22nd Symp. Comp. Geom, pp.292-300, 2006.

E. Guy, J. C. Blelloch, G. L. Hardwick, D. Miller, and . Talmor, Design and implementation 0

J. Boissonnat, O. Devillers, and S. Hornus, Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension, Proceedings of the 25th annual symposium on Computational geometry, SCG '09, 2009.
DOI : 10.1145/1542362.1542403

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

URL : http://comjnl.oxfordjournals.org/cgi/content/short/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, vol.21, issue.1, pp.61-80, 1995.
DOI : 10.1002/cpe.4330070106

P. Cignoni and C. Montani, 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. Disc. & Comp. Geom, vol.4, issue.5, pp.387-421, 1989.

C. Delage, Spatial sorting, CGAL Manual. 3.4 edition, 2008.

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, 2008.

L. Kettner, A. Meyer, and A. Zomorodian, Intersecting sequences of dD iso-oriented boxes, 2008.

J. Kohout, I. Kolingerová, and J. , 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

S. Pion and M. Teillaud, 3D triangulations, CGAL Manual. 3.4 edition, 2008.

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

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, Proc. 13th Eur. Conf. Parallel and Distributed Comp, pp.682-694, 2007.
DOI : 10.1007/978-3-540-74466-5_72

H. Tangelder and A. Fabri, dD spatial searching, CGAL Manual. 3.4 edition, 2008.

F. David and . Watson, Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes, Comput. J, vol.24, issue.2, pp.167-172, 1981.

A. Zomorodian and H. Edelsbrunner, FAST SOFTWARE FOR BOX INTERSECTIONS, International Journal of Computational Geometry & Applications, vol.12, issue.01n02, pp.143-172, 2002.
DOI : 10.1142/S0218195902000785