default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMonique Teillaud
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Vincent Despré, Benedikt Kolbe, Monique Teillaud:
Representing Infinite Periodic Hyperbolic Delaunay Triangulations Using Finitely Many Dirichlet Domains. Discret. Comput. Geom. 72(1): 1-28 (2024)- 2023
- [c28]Vincent Despré, Benedikt Kolbe, Hugo Parlier, Monique Teillaud:
Computing a Dirichlet Domain for a Hyperbolic Surface. SoCG 2023: 27:1-27:15 - 2022
- [j27]Matthijs Ebbens, Iordan Iordanov, Monique Teillaud, Gert Vegter:
Delaunay triangulations of generalized Bolza surfaces. J. Comput. Geom. 13(1): 125-177 (2022) - [i10]Vincent Despré, Benedikt Kolbe, Hugo Parlier, Monique Teillaud:
Computing a Dirichlet domain for a hyperbolic surface. CoRR abs/2212.01934 (2022) - 2021
- [i9]Matthijs Ebbens, Iordan Iordanov, Monique Teillaud, Gert Vegter:
Delaunay triangulations of generalized Bolza surfaces. CoRR abs/2103.05960 (2021) - 2020
- [j26]Samuel Hornus, Tim Kuipers
, Olivier Devillers, Monique Teillaud, Jonàs Martínez, Marc Glisse, Sylvain Lazard, Sylvain Lefebvre:
Variable-width contouring for additive manufacturing. ACM Trans. Graph. 39(4): 131 (2020) - [c27]Vincent Despré, Jean-Marc Schlenker, Monique Teillaud:
Flipping Geometric Triangulations on Hyperbolic Surfaces. SoCG 2020: 35:1-35:16 - [c26]Georg Osang, Mael Rouxel-Labbé, Monique Teillaud:
Generalizing CGAL Periodic Delaunay Triangulations. ESA 2020: 75:1-75:17
2010 – 2019
- 2019
- [i8]Vincent Despré, Jean-Marc Schlenker, Monique Teillaud:
Flipping Geometric Triangulations on Hyperbolic Surfaces. CoRR abs/1912.04640 (2019) - 2017
- [j25]Olivier Devillers, Menelaos Karavelas, Monique Teillaud:
Qualitative symbolic perturbation: two applications of a new geometry-based perturbation framework. J. Comput. Geom. 8(1): 282-315 (2017) - [c25]Iordan Iordanov, Monique Teillaud:
Implementing Delaunay Triangulations of the Bolza Surface. SoCG 2017: 44:1-44:15 - 2016
- [j24]Manuel Caroli, Monique Teillaud:
Delaunay Triangulations of Closed Euclidean d-Orbifolds. Discret. Comput. Geom. 55(4): 827-853 (2016) - [c24]Mikhail Bogdanov, Monique Teillaud, Gert Vegter:
Delaunay Triangulations on Orientable Surfaces of Low Genus. SoCG 2016: 20:1-20:17 - [c23]Olivier Devillers, Menelaos Karavelas, Monique Teillaud:
Qualitative Symbolic Perturbation. SoCG 2016: 33:1-33:17 - 2015
- [j23]Efi Fogel, Monique Teillaud:
The computational geometry algorithms library CGAL. ACM Commun. Comput. Algebra 49(1): 10-12 (2015) - [i7]Otfried Cheong, Jeff Erickson, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 15111). Dagstuhl Reports 5(3): 41-62 (2015) - 2014
- [j22]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [j21]Mikhail Bogdanov, Olivier Devillers, Monique Teillaud:
Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical. J. Comput. Geom. 5(1): 56-85 (2014) - 2013
- [j20]Efi Fogel, Monique Teillaud:
The computational geometry algorithms library CGAL. ACM Commun. Comput. Algebra 47(3/4): 85-87 (2013) - [c22]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c21]Mikhail Bogdanov, Olivier Devillers, Monique Teillaud:
Hyperbolic delaunay complexes and voronoi diagrams made practical. SoCG 2013: 67-76 - [i6]Otfried Cheong, Kurt Mehlhorn, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 13101). Dagstuhl Reports 3(3): 1-23 (2013) - [i5]Stephen G. Kobourov, Martin Nöllenburg, Monique Teillaud:
Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151). Dagstuhl Reports 3(4): 34-68 (2013) - 2012
- [c20]Johan Hidding, Rien van de Weygaert, Gert Vegter, Bernard J. T. Jones, Monique Teillaud:
The sticky geometry of the cosmic web. SCG 2012: 421-422 - 2011
- [j19]Olivier Devillers, Monique Teillaud:
Perturbations for Delaunay and weighted Delaunay 3D triangulations. Comput. Geom. 44(3): 160-168 (2011) - [j18]Rien van de Weygaert, Gert Vegter, Herbert Edelsbrunner, Bernard J. T. Jones, Pratyush Pranav, Changbom Park, Wojciech A. Hellwing, Bob Eldering, Nico Kruithof, E. G. P. (Patrick) Bos, Johan Hidding, Job Feldbrugge, Eline ten Have, Matti van Engelen, Manuel Caroli, Monique Teillaud:
Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web. Trans. Comput. Sci. 14: 60-101 (2011) - [c19]Manuel Caroli, Monique Teillaud:
Delaunay triangulations of point sets in closed euclidean d-manifolds. SCG 2011: 274-282 - [i4]Pankaj K. Agarwal, Kurt Mehlhorn, Monique Teillaud:
Computational Geometry (Dagstuhl Seminar 11111). Dagstuhl Reports 1(3): 19-41 (2011) - 2010
- [j17]Monique Teillaud:
Foreword. Comput. Geom. 43(3): 233 (2010) - [c18]Manuel Caroli, Pedro Machado Manhães de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, Camille Wormser:
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere. SEA 2010: 462-473
2000 – 2009
- 2009
- [j16]Pedro Machado Manhães de Castro, Frédéric Cazals, Sébastien Loriot, Monique Teillaud:
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere. Comput. Geom. 42(6-7): 536-550 (2009) - [j15]Monique Teillaud:
Guest Editor's Foreword. Discret. Comput. Geom. 42(3): 341-342 (2009) - [c17]Manuel Caroli, Monique Teillaud:
Computing 3D Periodic Triangulations. ESA 2009: 59-70 - [e2]Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud:
Computational Geometry, 08.03. - 13.03.2009. Dagstuhl Seminar Proceedings 09111, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i3]Pankaj Kumar Agarwal, Helmut Alt, Monique Teillaud:
09111 Abstracts Collection - Computational Geometry. Computational Geometry 2009 - 2008
- [c16]Manuel Caroli, Nico Kruithof, Monique Teillaud:
Decoupling the CGAL 3D Triangulations from the Underlying Space. ALENEX 2008: 101-108 - [c15]Manuel Caroli, Monique Teillaud:
On the computation of 3d periodic triangulations. SCG 2008: 222-223 - [e1]Monique Teillaud:
Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. ACM 2008, ISBN 978-1-60558-071-5 [contents] - 2007
- [b3]Monique Teillaud:
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). University of Nice Sophia Antipolis, France, 2007 - [i2]Mridul Aanjaneya, Monique Teillaud:
Triangulating the Real Projective Plane. CoRR abs/0709.2831 (2007) - 2005
- [j14]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) - [c14]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 - [c13]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 - 2004
- [c12]Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, Elias P. Tsigaridas:
Towards and open curved kernel. SCG 2004: 438-446 - 2003
- [c11]Olivier Devillers, Monique Teillaud:
Perturbations and vertex removal in a 3D delaunay triangulation. SODA 2003: 313-319 - 2002
- [j13]Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time. Algorithmica 34(1): 39-46 (2002) - [j12]Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, Mariette Yvinec:
Triangulations in CGAL. Comput. Geom. 22(1-3): 5-19 (2002) - [j11]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) - [j10]Olivier Devillers, Sylvain Pion, Monique Teillaud:
Walking in a Triangulation. Int. J. Found. Comput. Sci. 13(2): 181-199 (2002) - 2001
- [c10]Olivier Devillers, Sylvain Pion, Monique Teillaud:
Walking in a triangulation. SCG 2001: 106-114 - [c9]Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time. ESA 2001: 312-320 - 2000
- [j9]Monique Teillaud:
Union and split operations on dynamic trapezoidal maps. Comput. Geom. 17(3-4): 153-163 (2000) - [c8]Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, Mariette Yvinec:
Triangulations in CGAL (extended abstract). SCG 2000: 11-18 - [c7]Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud:
Algebraic methods and arithmetic filtering for exact predicates on circle arcs. SCG 2000: 139-147 - [i1]Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud:
Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs. EuroCG 2000: 117-120
1990 – 1999
- 1999
- [c6]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. SCG 1999: 421-422 - 1998
- [j8]Jean-Daniel Boissonnat, Eelco de Lange, Monique Teillaud:
Slicing Minkowski sums for satellite antenna layout. Comput. Aided Des. 30(4): 255-265 (1998) - [j7]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
- [c5]Jean-Daniel Boissonnat, Eelco de Lange, Monique Teillaud:
Minkowski Operations for Satellite Antenna Layout. SCG 1997: 67-76 - 1996
- [j6]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. Geom. Appl. 6(1): 1-14 (1996) - [c4]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 - 1995
- [j5]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
- [b2]Monique Teillaud:
Towards Dynamic Randomized Algorithms in Computational Geometry. Lecture Notes in Computer Science 758, Springer 1993, ISBN 3-540-57503-0 - [j4]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) - [j3]Jean-Daniel Boissonnat, Monique Teillaud:
On the Randomized Construction of the Delaunay Tree. Theor. Comput. Sci. 112(2): 339-354 (1993) - [c3]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 - 1992
- [j2]Olivier Devillers, Stefan Meiser, Monique Teillaud:
Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation. Comput. Geom. 2: 55-80 (1992) - [j1]Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec:
Applications of Random Sampling to On-line Algorithms in Computational Geometry. Discret. Comput. Geom. 8: 51-71 (1992) - 1991
- [b1]Monique Teillaud:
Vers des algorithmes dynamiques randomisés en géométrie algorithmique. (Towards dynamic randomized algorithms in computational geometry). University of Paris-Sud, Orsay, France, 1991 - [c2]Olivier Devillers, Stefan Meiser, Monique Teillaud:
Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation. WADS 1991: 42-53
1980 – 1989
- 1986
- [c1]Jean-Daniel Boissonnat, Monique Teillaud:
The Hierarchical Representation of Objects: The Delaunay Tree. SCG 1986: 260-268
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
