2008 |
34 | | Monique Teillaud:
Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008
ACM 2008 |
33 | EE | Manuel Caroli,
Nico Kruithof,
Monique Teillaud:
Decoupling the CGAL 3D Triangulations from the Underlying Space.
ALENEX 2008: 101-108 |
32 | EE | Manuel Caroli,
Monique Teillaud:
On the computation of 3d periodic triangulations.
Symposium on Computational Geometry 2008: 222-223 |
2007 |
31 | EE | Mridul Aanjaneya,
Monique Teillaud:
Triangulating the Real Projective Plane
CoRR abs/0709.2831: (2007) |
2005 |
30 | EE | Jean Ponce,
Kenton McHenry,
Théodore Papadopoulo,
Monique Teillaud,
Bill Triggs:
On the Absolute Quadratic Complex and Its Application to Autocalibration.
CVPR (1) 2005: 780-787 |
29 | EE | Francois Anton,
Ioannis Z. Emiris,
Bernard Mourrain,
Monique Teillaud:
The Offset to an Algebraic Curve and an Application to Conics.
ICCSA (1) 2005: 683-696 |
28 | EE | Bernard Mourrain,
Jean-Pierre Técourt,
Monique Teillaud:
On the computation of an arrangement of quadrics in 3D.
Comput. Geom. 30(2): 145-164 (2005) |
2004 |
27 | EE | Ioannis Z. Emiris,
Athanasios Kakargias,
Sylvain Pion,
Monique Teillaud,
Elias P. Tsigaridas:
Towards and open curved kernel.
Symposium on Computational Geometry 2004: 438-446 |
2003 |
26 | EE | Olivier Devillers,
Monique Teillaud:
Perturbations and vertex removal in a 3D delaunay triangulation.
SODA 2003: 313-319 |
2002 |
25 | EE | Bernard Chazelle,
Olivier Devillers,
Ferran Hurtado,
Mercè Mora,
Vera Sacristan,
Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time.
Algorithmica 34(1): 39-46 (2002) |
24 | | Olivier Devillers,
Alexandra Fronville,
Bernard Mourrain,
Monique Teillaud:
Algebraic methods and arithmetic filtering for exact predicates on circle arcs.
Comput. Geom. 22(1-3): 119-142 (2002) |
23 | | Jean-Daniel Boissonnat,
Olivier Devillers,
Sylvain Pion,
Monique Teillaud,
Mariette Yvinec:
Triangulations in CGAL.
Comput. Geom. 22(1-3): 5-19 (2002) |
22 | EE | Olivier Devillers,
Sylvain Pion,
Monique Teillaud:
Walking in a Triangulation.
Int. J. Found. Comput. Sci. 13(2): 181-199 (2002) |
2001 |
21 | EE | Bernard Chazelle,
Olivier Devillers,
Ferran Hurtado,
Mercè Mora,
Vera Sacristan,
Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time.
ESA 2001: 312-320 |
20 | EE | Olivier Devillers,
Sylvain Pion,
Monique Teillaud:
Walking in a triangulation.
Symposium on Computational Geometry 2001: 106-114 |
2000 |
19 | | Olivier Devillers,
Alexandra Fronville,
Bernard Mourrain,
Monique Teillaud:
Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs.
EWCG 2000: 117-120 |
18 | EE | Jean-Daniel Boissonnat,
Olivier Devillers,
Monique Teillaud,
Mariette Yvinec:
Triangulations in CGAL (extended abstract).
Symposium on Computational Geometry 2000: 11-18 |
17 | EE | Olivier Devillers,
Alexandra Fronville,
Bernard Mourrain,
Monique Teillaud:
Algebraic methods and arithmetic filtering for exact predicates on circle arcs.
Symposium on Computational Geometry 2000: 139-147 |
16 | | Monique Teillaud:
Union and split operations on dynamic trapezoidal maps.
Comput. Geom. 17(3-4): 153-163 (2000) |
1999 |
15 | EE | Jean-Daniel Boissonnat,
Frédéric Cazals,
Frank Da,
Olivier Devillers,
Sylvain Pion,
François Rebufat,
Monique Teillaud,
Mariette Yvinec:
Programming with CGAL: The Example of Triangulations.
Symposium on Computational Geometry 1999: 421-422 |
1998 |
14 | EE | Jean-Daniel Boissonnat,
Eelco de Lange,
Monique Teillaud:
Slicing Minkowski sums for satellite antenna layout.
Computer-Aided Design 30(4): 255-265 (1998) |
13 | EE | Mark de Berg,
Otfried Cheong,
Olivier Devillers,
Marc J. van Kreveld,
Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons under Translations.
Theory Comput. Syst. 31(5): 613-628 (1998) |
1997 |
12 | EE | Jean-Daniel Boissonnat,
Eelco de Lange,
Monique Teillaud:
Minkowski Operations for Satellite Antenna Layout.
Symposium on Computational Geometry 1997: 67-76 |
1996 |
11 | | Mark de Berg,
Olivier Devillers,
Marc J. van Kreveld,
Otfried Schwarzkopf,
Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons Under Translations.
ISAAC 1996: 126-135 |
10 | | Jean-Daniel Boissonnat,
André Cérézo,
Olivier Devillers,
Monique Teillaud:
Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes.
Int. J. Comput. Geometry Appl. 6(1): 1-14 (1996) |
1995 |
9 | EE | Mark de Berg,
Leonidas J. Guibas,
Dan Halperin,
Mark H. Overmars,
Otfried Schwarzkopf,
Micha Sharir,
Monique Teillaud:
Reaching a Goal with Directional Uncertainty.
Theor. Comput. Sci. 140(2): 301-317 (1995) |
1993 |
8 | | Monique Teillaud:
Towards Dynamic Randomized Algorithms in Computational Geometry
Springer 1993 |
7 | | Mark de Berg,
Mark H. Overmars,
Leonidas J. Guibas,
Otfried Schwarzkopf,
Monique Teillaud,
Dan Halperin,
Micha Sharir:
Reaching a Goal with Directional Uncertainty.
ISAAC 1993: 1-10 |
6 | | Jean-Daniel Boissonnat,
Olivier Devillers,
Monique Teillaud:
A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis.
Algorithmica 9(4): 329-356 (1993) |
5 | | Jean-Daniel Boissonnat,
Monique Teillaud:
On the Randomized Construction of the Delaunay Tree.
Theor. Comput. Sci. 112(2): 339-354 (1993) |
1992 |
4 | | Olivier Devillers,
Stefan Meiser,
Monique Teillaud:
Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation.
Comput. Geom. 2: 55-80 (1992) |
3 | | Jean-Daniel Boissonnat,
Olivier Devillers,
René Schott,
Monique Teillaud,
Mariette Yvinec:
Applications of Random Sampling to On-line Algorithms in Computational Geometry.
Discrete & Computational Geometry 8: 51-71 (1992) |
1991 |
2 | | Olivier Devillers,
Stefan Meiser,
Monique Teillaud:
Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation.
WADS 1991: 42-53 |
1986 |
1 | EE | Jean-Daniel Boissonnat,
Monique Teillaud:
The Hierarchical Representation of Objects: The Delaunay Tree.
Symposium on Computational Geometry 1986: 260-268 |