| Triangulations in CGAL JD Boissonnat, O Devillers, M Teillaud, M Yvinec 16th Annual Symposium on Computational geometry, 11-18, 2000 | 324 | 2000 |
| Walking in a triangulation O Devillers, S Pion, M Teillaud 17th Annual Symposium on Computational geometry, 106-114, 2001 | 230 | 2001 |
| On the randomized construction of the Delaunay tree JD Boissonnat, M Teillaud Theoretical Computer Science 112 (2), 339-354, 1993 | 165 | 1993 |
| Applications of Random Sampling to On-line Algorithms in Computational Geometry JD Boissonnat, O Devillers, R Schott, M Teillaud, M Yvinec Discrete & Computational Geometry, 1992 | 156 | 1992 |
| Effective computational geometry for curves and surfaces JD Boissonnat, M Teillaud Springer Verlag (Mathematics & visualization), 2007 | 131 | 2007 |
| A hierarchical representation of objects: the Delaunay tree JD Boissonnat, M Teillaud 2nd Annual Symposium on Computational geometry, 260-268, 1986 | 107 | 1986 |
| Fully dynamic Delaunay triangulation in logarithmic expected time per operation O Devillers, S Meiser, M Teillaud Computational Geometry 2 (2), 55-80, 1992 | 100 | 1992 |
| Alpha, Betti and the megaparsec universe: on the topology of the cosmic web R Van De Weygaert, G Vegter, H Edelsbrunner, BJT Jones, P Pranav, ... Transactions on Computational Science XIV, 60-101, 2011 | 72 | 2011 |
| Towards an open curved kernel IZ Emiris, A Kakargias, S Pion, M Teillaud, EP Tsigaridas 20th Annual Aymposium on Computational geometry, 438-446, 2004 | 69 | 2004 |
| Perturbations and vertex removal in a 3D Delaunay triangulation O Devillers, M Teillaud 14th Annual ACM-SIAM Symposium on Discrete algorithms, 313-319, 2003 | 66 | 2003 |
| Algebraic methods and arithmetic filtering for exact predicates on circle arcs O Devillers, A Fronville, B Mourrain, M Teillaud 16th Annual Symposium on Computational geometry, 139-147, 2000 | 64 | 2000 |
| 3D triangulations S Pion, M Teillaud CGAL Editorial Board, editor, CGAL User and Reference Manual, 2001 | 60* | 2001 |
| A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis JD Boissonnat, O Devillers, M Teillaud Algorithmica 9 (4), 329-356, 1993 | 59 | 1993 |
| On the computation of an arrangement of quadrics in 3d B Mourrain, JP Técourt, M Teillaud Computational Geometry 30 (2), 145-164, 2005 | 58 | 2005 |
| On the absolute quadratic complex and its application to autocalibration J Ponce, K McHenry, T Papadopoulo, M Teillaud, B Triggs 2005 IEEE Computer Society Conference on Computer Vision and Pattern …, 2005 | 56 | 2005 |
| Computing the maximum overlap of two convex polygons under translations M De Berg, O Cheong, O Devillers, M Van Kreveld, M Teillaud Theory of computing systems 31 (5), 613-628, 1998 | 46 | 1998 |
| Computing 3D periodic triangulations M Caroli, M Teillaud Proceedings 17th European Symposium on Algorithms, 59-70, 2009 | 43 | 2009 |
| Splitting a Delaunay triangulation in linear time B Chazelle, O Devillers, F Hurtado, M Mora, V Sacristán, M Teillaud Algorithmica 34 (1), 39-46, 2002 | 43 | 2002 |
| The space of spheres, a geometric tool to unify duality results on Voronoi diagrams O Devillers, S Meiser, M Teillaud INRIA, 1992 | 40 | 1992 |
| Arrangements E Fogel, D Halperin, L Kettner, M Teillaud, R Wein, N Wolpert Effective Computational Geometry for Curves and Surfaces, 1-66, 2006 | 39 | 2006 |
Olivier DevillersINRIA Nancy - Grand Est, LORIAVerified email at normalesup.org
