Skip to Main content Skip to Navigation


hal-01180166v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersMonique Teillaud. An on-line construction of higher-order Voronoi diagrams and its randomized analysis
Canadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281
...
inria-00344433v1  Conference papers
Ioannis Z. EmirisAthanasios KakargiasSylvain PionMonique TeillaudElias Tsigaridas. Towards an Open Curved Kernel
ACM Symposium on Computational Geometry, Jun 2004, New York, United States. pp.438-446
...
inria-00350878v1  Conference papers
François AntonIoannis Z. EmirisBernard MourrainMonique Teillaud. The Offset to an Algebraic Curve and an Application to Conics
International Conference on Computational Science and its Applications, May 2005, Singapore, Singapore. pp.683-696
hal-01180168v1  Conference papers
Luc TancrediMonique TeillaudOlivier Devillers. Symbolic Elimination for parallel manipulators
Communication at 4th International Symposium on Effective Methods in Algebraic Geometry (MEGA)., 1996, Eindhoven, Netherlands
...
inria-00166710v2  Conference papers
Olivier DevillersMonique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation
Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, Baltimore, MA, United States. pp.313--319
hal-01179408v1  Conference papers
Olivier DevillersJean-Daniel BoissonnatMariette YvinecMonique Teillaud. Triangulations in CGAL
Proceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.11-18, ⟨10.1145/336154.336165⟩
...
hal-00846953v1  Conference papers
Patrizio AngeliniDavid EppsteinFabrizio FratiMichael KaufmannSylvain Lazard et al.  Universal Point Sets for Planar Graph Drawings with Circular Arcs
Canadian Conference on Computational Geometry, Aug 2013, Waterloo, Canada. pp.117-122
...
hal-00997207v1  Journal articles
Patrizio AngeliniDavid EppsteinFabrizio FratiMichael KaufmannSylvain Lazard et al.  Universal Point Sets for Planar Graph Drawing with Circular Arcs
Journal of Graph Algorithms and Applications, Brown University, 2014, 18 (3), pp.313-324. ⟨10.7155/jgaa.00324⟩
hal-01179417v1  Conference papers
Olivier DevillersAlexandra FronvilleBernard MourrainMonique Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Proceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.139-147, ⟨10.1145/336154.336194⟩
hal-01180164v1  Conference papers
Olivier DevillersStefan MeiserMonique Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Workshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53
hal-01180157v1  Conference papers
Olivier DevillersStefan MeiserMonique Teillaud. The space of spheres, a geometric tool to unify duality results on Voronoi diagrams
Canadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.263-268
hal-01179450v1  Conference papers
Mark De BergOlivier DevillersMarc Van KreveldOtfried SchwarzkopfMonique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations
International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135
...
inria-00412352v1  Conference papers
Oswin AichholzerFranz AurenhammerOlivier DevillersThomas HacklMonique Teillaud et al.  Lower and upper bounds on the number of empty cylinders and ellipsoids
European Workshop on Computational Geometry, Mar 2009, Bruxelles, Belgium. pp.139-142
inria-00537545v1  Book sections
Eric BerberichMichael HemmerSylvain LazardLuis PeñarandaMonique Teillaud. Algebraic kernel
CGAL Editorial board. CGAL User and Reference Manual, 3.6 edition, CGAL Editorial board, 2010