Monique Teillaud

  • INRIA, France

According to our database1, Monique Teillaud authored at least 57 papers between 1986 and 2023.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Computing a Dirichlet Domain for a Hyperbolic Surface.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Delaunay triangulations of generalized Bolza surfaces.
J. Comput. Geom., 2022

Variable-width contouring for additive manufacturing.
ACM Trans. Graph., 2020

Generalizing CGAL Periodic Delaunay Triangulations.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Flipping Geometric Triangulations on Hyperbolic Surfaces.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Qualitative symbolic perturbation: two applications of a new geometry-based perturbation framework.
J. Comput. Geom., 2017

Implementing Delaunay Triangulations of the Bolza Surface.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Delaunay Triangulations of Closed Euclidean d-Orbifolds.
Discret. Comput. Geom., 2016

Qualitative Symbolic Perturbation.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Delaunay Triangulations on Orientable Surfaces of Low Genus.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Computational Geometry (Dagstuhl Seminar 15111).
Dagstuhl Reports, 2015

Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical.
J. Comput. Geom., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.
J. Graph Algorithms Appl., 2014

Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151).
Dagstuhl Reports, 2013

Computational Geometry (Dagstuhl Seminar 13101).
Dagstuhl Reports, 2013

The computational geometry algorithms library CGAL.
ACM Commun. Comput. Algebra, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

The sticky geometry of the cosmic web.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.
Trans. Comput. Sci., 2011

Computational Geometry (Dagstuhl Seminar 11111).
Dagstuhl Reports, 2011

Perturbations for Delaunay and weighted Delaunay 3D triangulations.
Comput. Geom., 2011

Delaunay triangulations of point sets in closed euclidean d-manifolds.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Comput. Geom., 2010

Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Guest Editor's Foreword.
Discret. Comput. Geom., 2009

Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere.
Comput. Geom., 2009

Computing 3D Periodic Triangulations.
Proceedings of the Algorithms, 2009

09111 Abstracts Collection - Computational Geometry.
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

On the computation of 3d periodic triangulations.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Decoupling the CGAL 3D Triangulations from the Underlying Space.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

Triangulating the Real Projective Plane
CoRR, 2007

Géométrie algorithmique - De la théorie à la pratique,Des objets linéaires aux objets courbes. (Computational geometry - From theory to practice,From linear objects to curved objects).
, 2007

On the computation of an arrangement of quadrics in 3D.
Comput. Geom., 2005

The Offset to an Algebraic Curve and an Application to Conics.
Proceedings of the Computational Science and Its Applications, 2005

On the Absolute Quadratic Complex and Its Application to Autocalibration.
Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 2005

Towards and open curved kernel.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Perturbations and vertex removal in a 3D delaunay triangulation.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Walking in a Triangulation.
Int. J. Found. Comput. Sci., 2002

Algebraic methods and arithmetic filtering for exact predicates on circle arcs.
Comput. Geom., 2002

Triangulations in CGAL.
Comput. Geom., 2002

Splitting a Delaunay Triangulation in Linear Time.
Algorithmica, 2002

Union and split operations on dynamic trapezoidal maps.
Comput. Geom., 2000

Triangulations in CGAL (extended abstract).
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Programming with CGAL: The Example of Triangulations.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Computing the Maximum Overlap of Two Convex Polygons under Translations.
Theory Comput. Syst., 1998

Slicing Minkowski sums for satellite antenna layout.
Comput. Aided Des., 1998

Minkowski Operations for Satellite Antenna Layout.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes.
Int. J. Comput. Geom. Appl., 1996

Reaching a Goal with Directional Uncertainty.
Theor. Comput. Sci., 1995

On the Randomized Construction of the Delaunay Tree.
Theor. Comput. Sci., 1993

A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis.
Algorithmica, 1993

Towards Dynamic Randomized Algorithms in Computational Geometry
Lecture Notes in Computer Science 758, Springer, ISBN: 3-540-57503-0, 1993

Applications of Random Sampling to On-line Algorithms in Computational Geometry.
Discret. Comput. Geom., 1992

Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation.
Comput. Geom., 1992

Vers des algorithmes dynamiques randomisés en géométrie algorithmique. (Towards dynamic randomized algorithms in computational geometry).
PhD thesis, 1991

Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation.
Proceedings of the Algorithms and Data Structures, 1991

The Hierarchical Representation of Objects: The Delaunay Tree.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986