1. Otfried Cheong, Kurt Mehlhorn, and Monique Teillaud, editors. Computational Geometry (Dagstuhl Seminar), number 13101 of Dagstuhl Reports, 2013. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. ISSN: 2192-5283. [WWW] [doi:http://dx.doi.org/10.4230/DagRep.3.3.1]



2. Stephen G. Kobourov, Martin Nöllenburg, and Monique Teillaud, editors. Drawing Graphs and Maps with Curves (Dagstuhl Seminar), number 13151 of Dagstuhl Reports, 2013. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. ISSN: 2192-5283. [WWW] [doi:10.4230/DagRep.3.4.34]



3. Pankaj Kumar Agarwal, Kurt Mehlhorn, and Monique Teillaud, editors. Computational Geometry (Dagstuhl Seminar), number 11111 of Dagstuhl Reports, 2011. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Germany. ISSN: 2192-5283. [WWW] [doi:10.4230/DagRep.1.3.19]



4. Monique Teillaud, editor. Computational Geometry: Theory and Applications - Special Issue on the 24th Annual Symposium on Computational Geometry, 43(3), pages 233--328, April 2010. Elsevier. ISSN: 0925-7721. [WWW]



5. Pankaj Kumar Agarwal, Helmut Alt, and Monique Teillaud, editors. Computational Geometry, number 09111 of Dagstuhl Seminar Proceedings, 2009. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Germany. ISSN: 1862-4405. [WWW]



6. Monique Teillaud, editor. Discrete and Computational Geometry - Special Issue on the 24th Annual Symposium on Computational Geometry, 42(3), pages 341--516, October 2009. Springer-Verlag. ISSN: 0179-5376 (Print) 1432-0444 (Online). [WWW]



7. Monique Teillaud, editor. Proceedings of the 24th Annual Symposium on Computational Geometry, June 9-11 2008. ACM. ISBN: 978-1-60558-071-5. [WWW]



8. Jean-Daniel Boissonnat and Monique Teillaud, editors. Effective Computational Geometry for Curves and Surfaces. Springer-Verlag, 2006. [WWW]



9. M. Teillaud, editor. Journées de Géométrie Algorithmique, 1998. INRIA. Note: Supports de cours, E067. [WWW]



10. M. Teillaud. Towards dynamic randomized algorithms in computational geometry, volume 758 of Lecture Notes in Computer Science. Springer-Verlag, 1993.

1. 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.. Habilitation à diriger des recherches, Université de Nice Sophia Antipolis, 2007. [WWW]



2. M. Teillaud. Vers des algorithmes randomisés dynamiques en géométrie algorithmique. Thèse de doctorat en sciences, Université Paris-Sud, Orsay, France, 1991. [WWW]

1. Mikhail Bogdanov, Olivier Devillers, and Monique Teillaud. Hyperbolic Delaunay complexes and Voronoi diagrams made practical. Journal of Computational Geometry, 5:56-85, 2014. [WWW]



2. Efi Fogel and Monique Teillaud. The Computational Geometry Algorithms Library CGAL. ACM Communications in Computer Algebra, 47(3):85-87, September 2013. [WWW]



3. Pierre Alliez, Christophe Delage, Menelaos I. Karavelas, Sylvain Pion, Monique Teillaud, and Mariette Yvinec. Delaunay Tessellations and Voronoi Diagrams in CGAL. In Tessellations in the Sciences. Springer-Verlag, 2012. Note: To appear.



4. Olivier Devillers and Monique Teillaud. Perturbations for Delaunay and weighted Delaunay 3D Triangulations. Computational Geometry: Theory and Applications, 44:160-168, 2011. [WWW] [doi:10.1016/j.comgeo.2010.09.010]



5. Pedro Machado Manhães de Castro, Frédéric Cazals, Sébastien Loriot, and Monique Teillaud. Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere. Computational Geometry: Theory and Applications, 42(6-7):536-550, 2009.



6. Efi Fogel, Dan Halperin, Lutz Kettner, Monique Teillaud, Ron Wein, and Nicola Wolpert. Arrangements. In Jean-Daniel Boissonnat and Monique Teillaud, editors, Effective Computational Geometry for Curves and Surfaces, pages 1-66. Springer-Verlag, Mathematics and Visualization, 2006.



7. Efi Fogel and Monique Teillaud. Generic Programming and The CGAL Library. In Jean-Daniel Boissonnat and Monique Teillaud, editors, Effective Computational Geometry for Curves and Surfaces, pages 313-320. Springer-Verlag, Mathematics and Visualization, 2006. [WWW]



8. Bernard Mourrain, Jean-Pierre Técourt, and Monique Teillaud. On the Computation of an Arrangement of Quadrics in 3D. Computational Geometry: Theory and Applications, 30:145-164, 2005. Note: Special issue, 19th European Workshop on Computational Geometry.



9. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, and Mariette Yvinec. Triangulations in CGAL. Computational Geometry: Theory and Applications, 22:5-19, 2002. [WWW] [doi:10.1016/S0925-7721(01)00054-2]



10. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, and Monique Teillaud. Splitting a Delaunay Triangulation in Linear Time. Algorithmica, 34:39-46, 2002. [WWW]



11. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, and Monique Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Computational Geometry: Theory and Applications, 22:119-142, 2002. [WWW]



12. Olivier Devillers, Sylvain Pion, and Monique Teillaud. Walking in a triangulation. Internat. J. Found. Comput. Sci., 13:181-199, 2002. [WWW] [doi:10.1142/S0129054102001047]



13. M. Teillaud. Union and Split Operations on Dynamic Trapezoidal Maps. Computational Geometry: Theory and Applications, 17:153-163, 2000.



14. Luc Tancredi and Monique Teillaud. Application de la géométrie synthétique au problème de modélisation géométrique directe des robots parallèles. Mechanism and Machine Theory, 34:255-269, 1999.



15. J-D. Boissonnat, E. de Lange, and M. Teillaud. Slicing Minkowski Sums for Satellite Antenna Layout. Computer-Aided Design, 30(4):255-265, 1998. Note: Special Issue on Computational Geometry and Computer-Aided Design and Manufacturing.



16. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc van Kreveld, and Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. Theory of Computing Systems, 31:613-628, 1998. [WWW]



17. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the Delaunay triangulation of points lying in two planes. Internat. J. Comput. Geom. Appl., 6(1):1-14, 1996. [WWW] [doi:10.1142/S0218195996000022]



18. M. de Berg, L. Guibas, D. Halperin, M. Overmars, O. Schwarzkopf, M. Sharir, and M. Teillaud. Reaching a Goal with Directional Uncertainty. Theoret. Comput. Sci., 140:301-318, 1995.



19. L. Tancredi, M. Teillaud, and J-P. Merlet. Forward kinematics of a parallel manipulator with additional rotary sensors measuring the position of platform joints. In J-P. Merlet and B. Ravani, editors, Computational Kinematics, pages 261-270. Kluwer Academic Publishers, 1995.



20. J.-D. Boissonnat, O. Devillers, and M. Teillaud. A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis. Algorithmica, 9:329-356, 1993. [WWW] Keyword(s): randomized algorithms, higher order Voronoi diagrams, dynamic algorithms.



21. J.-D. Boissonnat and M. Teillaud. On the randomized construction of the Delaunay tree. Theoret. Comput. Sci., 112:339-354, 1993. [WWW] Keyword(s): randomized algorithms, Delaunay triangulation, semi-dynamic algorithms.



22. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete and Computational Geometry, 8:51-71, 1992. [WWW] Keyword(s): randomized algorithms, Delaunay triangulation, semi-dynamic algorithms, arrangement of line-segments.



23. O. Devillers, S. Meiser, and M. Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Computational Geometry: Theory and Applications, 2(2):55-80, 1992. [WWW] Keyword(s): randomized algorithms, Delaunay triangulation, dynamizing data structures.



24. O. Devillers, M. Teillaud, and M. Yvinec. Dynamic location in an arrangement of line segments in the plane. Algorithms Review, 2(3):89-103, 1992. [WWW] Keyword(s): randomized algorithms, arrangement of line-segments, dynamizing data structures.

1. Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, and Alexander Wolff. Universal Point Sets for Planar Graph Drawings with Circular Arcs. In Proceedings 25th Canadian Conference on Computational Geometry, pages 117-122, 2013. [WWW]



2. Mikhail Bogdanov, Olivier Devillers, and Monique Teillaud. Hyperbolic Delaunay complexes and Voronoi diagrams made practical. In Proc. of the 29th Annual Symposium on Computational Geometry, pages 67-76, 2013. [WWW] [doi:10.1145/2462356.2462365]



3. Mikhail Bogdanov, Monique Teillaud, and Gert Vegter. Covering spaces and Delaunay triangulations of the 2D flat torus. In Abstracts 28th European Workshop on Computational Geometry, pages 9-12, 2012. [PDF]



4. Johan Hidding, Rien van de Weygaert, Gert Vegter, Bernard J.T. Jones, and Monique Teillaud. Video: The Sticky Geometry of the Cosmic Web. In Proceedings 28th Annual Symposium on Computational Geometry, pages 421-422, 2012. [WWW]



5. Mikhail Bogdanov, Olivier Devillers, and Monique Teillaud. Hyperbolic Delaunay triangulations and Voronoi diagrams made practical. In Abstracts XIV Spanish Meeting on Computational Geometry, pages 113-116, 2011. [WWW]



6. Manuel Caroli and Monique Teillaud. Delaunay Triangulations of Point Sets in Closed Euclidean d-Manifolds. In Proc. 27th Annual Symposium on Computational Geometry, pages 274-282, 2011. [WWW] [doi:10.1145/1998196.1998236]



7. Andreas Fabri and Monique Teillaud. CGAL, The Computational Geometry Algorithms Library. In 10ème Colloque National en Calcul des Structures, 2011.



8. 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. Patrick Bos, Johan Hidding, Job Feldbrugge, Eline ten Have, Matti van Engelen, Manuel Caroli, and Monique Teillaud. Alpha, Betti and the Megaparsec Universe: on the Homology and Topology of the Cosmic Web. In Transactions on Computational Science XIV, volume 6970 of Lecture Notes in Computer Science, pages 60-101, 2011. Springer-Verlag. [WWW]



9. Manuel Caroli, Vissarion Fisikopoulos, and Monique Teillaud. Meshing of Triply-Periodic Surfaces in CGAL. In 7th International Conference on Curves and Surfaces, 2010. Note: Poster presentation. [WWW]



10. Manuel Caroli and Monique Teillaud. Delaunay Triangulations of Point Sets in Closed Euclidean $d$-Manifolds. In Abstracts 26th European Workshop on Computational Geometry, pages 101-104, 2010. [PDF]



11. Manuel Caroli, Pedro M. M. de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, and Camille Wormser. Robust and Efficient Delaunay Triangulations of Points on or Close to a Sphere. In 9th International Symposium on Experimental Algorithms, volume 6049 of Lecture Notes in Computer Science, pages 462-473, 2010. [WWW]



12. Oswin Aichholzer, Franz Aurenhammer, Olivier Devillers, Thomas Hackl, Monique Teillaud, and Birgit Vogtenhuber. Lower and upper bounds on the number of empty cylinders and ellipsoids. In Abstracts 25th. European Workshop on Computational Geometry, pages 139-142, 2009. [WWW]



13. Manuel Caroli and Monique Teillaud. Computing 3D Periodic Triangulations. In European Symposium on Algorithms, volume 5757 of Lecture Notes in Computer Science, pages 37-48, 2009. [PDF]



14. Antoine Bru and Monique Teillaud. Generic Implementation of a Data Structure for 3D Regular Complexes. In Abstracts 24th European Workshop on Computational Geometry, pages 95-98, 2008.



15. Manuel Caroli, Nico Kruithof, and Monique Teillaud. Decoupling the CGAL 3D Triangulations from the Underlying Space. In Workshop on Algorithm Engineering and Experiments, pages 101-108, 2008. [PDF]



16. Manuel Caroli, Nico Kruithof, and Monique Teillaud. Triangulating the 3D periodic space. In Abstracts 24th European Workshop on Computational Geometry, pages 229-232, 2008. [PDF]



17. Manuel Caroli and Monique Teillaud. Video: On the Computation of 3D Periodic Triangulations. In Proc. 24th Annual Symposium on Computational Geometry, pages 222-223, 2008. [WWW]



18. Mridul Aanjaneya and Monique Teillaud. Triangulating the Real Projective Plane. In Mathematical Aspects of Computer and Information Sciences, 2007. [WWW]



19. Monique Teillaud. From triangles to curves, a practical point of view. In Communication at the Kyoto International Conference on Computational Geometry and Graph Theory, 2007. [WWW]



20. Pedro Machado Manhães de Castro, Sylvain Pion, and Monique Teillaud. Exact and efficient computations on circles in CGAL. In Abstracts 23rd. European Workshop on Computational Geometry, pages 219-222, 2007. Technische Universität Graz, Austria.



21. François Anton, Ioannis Emiris, Bernard Mourrain, and Monique Teillaud. The offset to an algebraic curve and an application to conics. In Proc. International Conference on Computational Science and its Applications, volume 3480 of Lecture Notes Comput. Sci., pages 683-696, 2005. Springer-Verlag.



22. Jean Ponce, Kenton McHenry, Théo Papadopoulo, Monique Teillaud, and Bill Triggs. On the Absolute Quadratic Complex and its Application to Autocalibration. In Proc. IEEE International Conference on Computer Vision and Pattern Recognition, volume 1, pages 780 - 787, 2005.



23. Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, and Elias P. Tsigaridas. Towards an Open Curved Kernel. In Proc. 20th Annual Symposium on Computational Geometry, pages 438-446, 2004. [WWW]



24. Olivier Devillers and Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pages 313-319, 2003. [WWW]



25. Bernard Mourrain, Jean-Pierre Técourt, and Monique Teillaud. Sweeping an Arrangement of Quadrics in 3D. In Proc. 19th European Workshop on Computational Geometry, pages 31-34, 2003.



26. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, and Monique Teillaud. Splitting a Delaunay Triangulation in Linear Time. In Proc. 9th. European Symposiun on Algorithms, volume 2161 of Lecture Notes in Computer Science, pages 312-320, 2001. Springer-Verlag.



27. Olivier Devillers, Sylvain Pion, and Monique Teillaud. Walking in a triangulation. In Proc. 17th Annual Symposium on Computational Geometry, pages 106-114, 2001. [WWW]



28. Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, and Mariette Yvinec. Triangulations in CGAL. In Proc. 16th Annual Symposium on Computational Geometry, pages 11-18, 2000.



29. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, and Monique Teillaud. Exact predicates for circle arcs arrangements. In Proc. 16th Annual Symposium on Computational Geometry, pages 139-147, 2000.



30. Jean-Daniel Boissonnat, Frédéric Cazals, Tran Kai Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, and Mariette Yvinec. Programming with CGAL: The Example of Triangulations. In Proc the 15th Annual Symposium on Computational Geometry, pages 421-423, 1999. [WWW]



31. J-D. Boissonnat, E. de Lange, and M. Teillaud. Minkowski operations for satellite antenna layout. In Proc. 13th Annual Symposium on Computational Geometry, pages 67-76, 1997. [PDF]



32. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc van Kreveld, and Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. In Proc. 7th Annu. Internat. Sympos. Algorithms Comput. (ISAAC 96), volume 1178 of Lecture Notes in Computer Science, pages 126-135, 1996. Springer-Verlag.



33. L. Tancredi, M. Teillaud, and J-P. Merlet. Extra Sensors for Solving the Forward Kinematics Problem of Parallel Manipulators. In 9th World Congress on the Theory of Machines and Mechanisms, volume 3, Milan, pages 2122-2126, 1995. \textscIFToMM.



34. Monique Teillaud. Union and Split Operations on Dynamic Trapezoidal Maps. In Proc. 7th Canad. Conf. Comput. Geom., pages 181-186, 1995.



35. M. de Berg, L. Guibas, D. Halperin, M. Overmars, O. Schwarzkopf, M. Sharir, and M. Teillaud. Reaching a Goal with Directional Uncertainty. In Proc. 4th Internat. Sympos. on Algorithms and Computation, volume 762 of Lecture Notes in Computer Science, pages 1-10, 1993. Springer-Verlag.



36. O. Devillers, S. Meiser, and M. Teillaud. The space of spheres, a geometric tool to unify duality results on Voronoi diagrams. In Proc. 4th Canad. Conf. Comput. Geom., pages 263-268, 1992.



37. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of points. In Proc. 3rd Canad. Conf. Comput. Geom., pages 110-113, 1991. Keyword(s): Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography.



38. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. On-line geometric algorithms with good expected behaviours. In Proc. 13th World Congress on Computation and Applied Math., pages 137-139, 1991.



39. O. Devillers, S. Meiser, and M. Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. In Proc. 2nd Workshop Algorithms Data Struct., volume 519 of Lecture Notes in Computer Science, pages 42-53, 1991. Springer-Verlag. Keyword(s): randomized algorithms, Delaunay triangulation, dynamizing data structures.



40. J.-D. Boissonnat, O. Devillers, and M. Teillaud. An on-line construction of higher-order Voronoi diagrams and its randomized analysis. In Proc. 2nd Canad. Conf. Comput. Geom., pages 278-281, 1990. Keyword(s): randomized algorithms, higher order Voronoi diagrams, dynamic algorithms.



41. J.-D. Boissonnat and M. Teillaud. A hierarchical representation of objects: the Delaunay tree. In Proc. 2nd Annual Symposium on Computational Geometry, pages 260-268, 1986. [WWW]

1. Mikhail Bogdanov, Olivier Devillers, and Monique Teillaud. Hyperbolic Delaunay complexes and Voronoi diagrams made practical. Research Report 8146, INRIA, 2012. [WWW]



2. Olivier Devillers, Menelaos I. Karavelas, and Monique Teillaud. Qualitative Symbolic Perturbation: a new geometry-based perturbation framework. Research Report 8153, INRIA, 2012. [WWW]



3. Mathieu Schmitt and Monique Teillaud. Meshing the hyperbolic octagon. Research Report 8179, INRIA, 2012. [WWW]



4. Rien van de Weygaert, Pratyush Pranav, Bernard J.T. Jones, E.G. Patrick Bos, Gert Vegter, Herbert Edelsbrunner, Monique Teillaud, Wojciech A. Hellwing, Changbom Park, Johan Hidding, and Mathijs Wintraecken. Probing Dark Energy with Alpha Shapes and Betti Numbers. Research Report, arXiv, 2011. [WWW]



5. Manuel Caroli and Monique Teillaud. Delaunay Triangulations of Point Sets in Closed Euclidean $d$-Manifolds. Research Report 7352, INRIA, 2010. [WWW]



6. Manuel Caroli and Monique Teillaud. Computing 3D Periodic Triangulations. Research Report 6823, INRIA, 2009. [WWW]



7. Manuel Caroli, Pedro Machado Manhães de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, and Camille Wormser. Robust and efficient Delaunay triangulations of points on or close to a sphere. Research Report 7004, INRIA, 2009. [WWW]



8. Oswin Aichholzer, Franz Aurenhammer, Olivier Devillers, Thomas Hackl, Monique Teillaud, and Birgit Vogtenhuber. Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem. Research Report 6748, INRIA, 2008. [WWW]



9. Pedro Machado Manhães de Castro and Monique Teillaud. CGAL 3D Spherical Kernel. Technical Report ACS-TR-363605-02, INRIA, 2008. [PDF]



10. Mridul Aanjaneya and Monique Teillaud. Triangulating the Real Projective Plane. Research Report 6296, INRIA, 2007. [WWW]



11. Eric Berberich, Michael Hemmer, Menelaos Karavelas, and Monique Teillaud. Revision of Interface specification of algebraic kernel. Research Report ACS-TR-243300-01, INRIA, NUA, MPI, 2007.



12. Manuel Caroli, Nico Kruithof, and Monique Teillaud. Decoupling the CGAL 3D Triangulations from the Underlying Space. Research Report 6318, INRIA, 2007. [WWW]



13. Monique Teillaud. Specifications of the CGAL 3D Circular Kernel. Research Report ACS-TR-243302-01, INRIA, 2007.



14. Pedro Machado Manhães de Castro, Frédéric Cazals, Sébastien Loriot, and Monique Teillaud. Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere. Research Report 6298, INRIA, 2007. [WWW]



15. Pedro Machado Manhães de Castro, Sylvain Pion, and Monique Teillaud. Benchmarks and evaluation of algebraic kernels for circles. Technical Report ACS-TR-243306-01, INRIA, 2007.



16. Pedro Machado Manhães de Castro, Sylvain Pion, and Monique Teillaud. CGAL package for 2d filtered circular kernel. Technical Report ACS-TR-243404-02, INRIA, 2007.



17. Pedro M.M. de Castro, Sylvain Pion, and Monique Teillaud. Exact and efficient computations on circles in CGAL and applications to VLSI design. Research Report 6091, INRIA, 2007. [WWW]



18. Eric Berberich, Michael Hemmer, Menelaos Karavelas, Sylvain Pion, Monique Teillaud, and Elias Tsigaridas. Interface specification of algebraic kernel. Technical Report ACS-TR-123101-01, INRIA, NUA, MPI, 2006.



19. Eric Berberich, Michael Hemmer, Menelaos Karavelas, Sylvain Pion, Monique Teillaud, and Elias Tsigaridas. Prototype implementation of the algebraic kernel. Technical Report ACS-TR-121202-01, INRIA, NUA, MPI, 2006.



20. Olivier Devillers and Monique Teillaud. Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations. Research Report 5968, INRIA, 2006. [WWW]



21. Sylvain Pion, Ilya Suslov, and Monique Teillaud. Benchmarking of different arrangement traits. Technical Report ACS-TR-123110-01, INRIA, 2006.



22. Sylvain Pion, Ilya Suslov, and Monique Teillaud. On the evaluation of 2D curved kernels. Technical Report ACS-TR-123104-01, INRIA, 2006.



23. Sylvain Pion, Monique Teillaud, and Constantinos P. Tsirogiannis. Geometric filtering of primitives on circular arcs. Technical Report ACS-TR-121105-01, INRIA, 2006.



24. Efraim Fogel, Dan Halperin, Ron Wein, Sylvain Pion, Monique Teillaud, Ioannis Z. Emiris, Athanasios Kakargias, Elias P. Tsigaridas, Eric Berberich, Arno Eigenwillig, Michael Hemmer, Lutz Kettner, Kurt Mehlhorn, Elmar Schömer, and Nicola Wolpert. An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs (preliminary version). Technical Report ECG-TR-361200-01, Tel-Aviv University, INRIA Sophia-Antipolis, MPI Saarbrücken, 2004.



25. Efi Fogel, Dan Halperin, Ron Wein, Monique Teillaud, Eric Berberich, Arno Eigenwillig, Susan Hert, and Lutz Kettner. Specification of the traits classes for CGAL arrangements of curves. Technical Report ECG-TR-241200-01, MPI Saarbrücken, INRIA Sophia-Antipolis, Tel-Aviv University, 2003.



26. Bernard Mourrain, Jean-Pierre Técourt, and Monique Teillaud. Predicates for the Sweeping of an Arrangement of Quadrics in 3D. Technical Report ECG-TR-242205-01, INRIA Sophia-Antipolis, 2003.



27. Sylvain Pion and Monique Teillaud. Towards a CGAL-like kernel for curves. Technical Report ECG-TR-302206-01, MPI Saarbrücken, INRIA Sophia-Antipolis, 2003.



28. Olivier Devillers and Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. Research Report 4624, INRIA, 2002. [WWW]



29. Bernard Mourrain, Jean-Pierre Técourt, and Monique Teillaud. Algebraic methods for dealing with 3D implicit quadrics. Technical Report ECG-TR-182105-02, INRIA Sophia-Antipolis, 2002. [POSTSCRIPT]



30. Monique Teillaud. First Prototype of a CGAL Geometric Kernel with Circular Arcs. Technical Report ECG-TR-182203-01, INRIA, 2002.



31. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, and Monique Teillaud. Splitting a Delaunay Triangulation in Linear Time. Research Report 4160, INRIA, 2001. [WWW]



32. Olivier Devillers, Sylvain Pion, and Monique Teillaud. Walking in a triangulation. Research Report 4120, INRIA, 2001. [WWW]



33. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, and Monique Teillaud. Exact predicates for circle arcs arrangements. Research Report 3826, INRIA, 1999. [WWW]



34. J-D. Boissonnat, E. de Lange, and M. Teillaud. Minkowski operations for satellite antenna layout. Research Report 3070, INRIA, 1996. [WWW]



35. L. Tancredi and M. Teillaud. Géométrie synthétique et robots parallèles. Research Report 2962, INRIA, 1996. [WWW]



36. L. Tancredi, M. Teillaud, and O. Devillers. Symbolic Elimination for parallel manipulators. Research Report 2809, INRIA, 1996. [WWW] Keyword(s): parallel manipulator, forward kinematics problem, algebraic geometry.



37. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc van Kreveld, and Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. Research Report 2832, INRIA, 1996. [WWW]



38. M. Teillaud. Union and Split Operations on Dynamic Trapezoidal Maps. Research Report 2486, INRIA, 1995. [WWW]



39. M. de Berg, L. Guibas, D. Halperin, M. Overmars, O. Schwarzkopf, M. Sharir, and M. Teillaud. Reaching a Goal with Directional Uncertainty. Research Report 2190, INRIA, 1994. [WWW]



40. O. Devillers, S. Meiser, and M. Teillaud. The space of spheres, a geometric tool to unify duality results on Voronoi diagrams. Research Report 1620, INRIA, 1992. [WWW] Keyword(s): duality results, generalized Voronoi diagrams, geometric transforms, upper lower envelopes.



41. M. Teillaud. Towards dynamic randomized algorithms in computational geometry. Research Report 1727, INRIA, 1992. Note: English version of a french thesis. [WWW]



42. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of points. Research Report 1415, INRIA, 1991. [WWW] Keyword(s): Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography.



43. O. Devillers, M. Teillaud, and M. Yvinec. Dynamic location in an arrangement of line segments in the plane. Research Report 1558, INRIA, 1991. [WWW]



44. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Research Report 1285, INRIA, 1990. [WWW] Keyword(s): randomized algorithms, Voronoi, Delaunay, trapezoidal map, dynamic algorithms.



45. J.-D. Boissonnat, O. Devillers, and M. Teillaud. A dynamic construction of higher-order Voronoi diagrams and its randomized analysis. Research Report 1207, INRIA, 1990. [WWW] Keyword(s): randomized algorithms, higher order Voronoi diagrams, dynamic algorithms.



46. O. Devillers, S. Meiser, and M. Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Research Report 1349, INRIA, 1990. [WWW]



47. J-D. Boissonnat and M. Teillaud. On the Randomized Construction of the Delaunay Tree. Research Report 1140, INRIA, 1989. [WWW] Keyword(s): randomized algorithms, Delaunay triangulation, semi-dynamic algorithms.

1. Eric Berberich, Michael Hemmer, Michael Kerber, Sylvain Lazard, Luis Peñaranda, and Monique Teillaud. Algebraic Kernel. 3.7 edition, 2010. [WWW]



2. Eric Berberich, Michael Hemmer, Sylvain Lazard, Luis Peñaranda, and Monique Teillaud. Algebraic Kernel. 3.6 edition, 2010. [WWW]



3. Manuel Caroli and Monique Teillaud. 3D Periodic Triangulations. 3.7 edition, 2010. [WWW]



4. Pedro Machado Manhães de Castro, Frédéric Cazals, Sébastien Loriot, and Monique Teillaud. 3D Spherical Geometry Kernel. 3.6 edition, 2010. [WWW]



5. Manuel Caroli and Monique Teillaud. 3D Periodic Triangulations. 3.5 edition, 2009. [WWW]



6. Pedro Machado Manhães de Castro, Sylvain Pion, and Monique Teillaud. 2D Circular Geometry Kernel. 3.4 edition, 2008. [WWW]



7. Pedro Machado Manhães de Castro and Monique Teillaud. 3D Spherical Geometry Kernel. 3.4 edition, 2008. [WWW]



8. Sylvain Pion and Monique Teillaud. 3D Triangulation Data Structure. 3.2 edition, 2006. Note: CGAL User and Reference Manual. [WWW]



9. Sylvain Pion and Monique Teillaud. 3D Triangulations. 3.2 edition, 2006. Note: CGAL User and Reference Manual. [WWW]



10. Andreas Fabri, Efraim Fogel, Bernd Gärtner, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Monique Teillaud, Remco Veltkamp, and Mariette Yvinec. The CGAL Manual. 2003. Note: Release 3.0. [WWW]



11. O. Devillers, A. Fabri, E. Flato, W. Freiseisen, B. Gärtner, G.-J. Giezeman, D. Halperin, M. Hoffmann, L. Kettner, G. Neyer, S. Har Peled, R. Rickenbach, S. Schirra, S. Schönherr, M. Teillaud, C. Vam Geem, R. Veltkamp, W. Wesselink, and M. Yvinec. The CGAL Reference Manual. Part 2: Basic Library. 1997. Note: Release 0.9. [WWW]



12. Sylvain Pion and Monique Teillaud. 2D Circular Kernel. 3.2 edition. Note: \{\tiny http\://www.cgal.org/Manual/last/doc_html/cgal_manual/packages.html#Pkg\:CircularKernel2.

1. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, and Monique Teillaud. Exact predicates for circle arcs arrangements, 2000. Note: 16th European Workshop Comput. Geom.



2. Olivier Devillers, François Rebufat, and Monique Teillaud. Cours CGAL, 1999. Note: Barcelone. [WWW]



3. Monique Teillaud. 3D triangulations in CGAL, 1999. Note: 15th European Workshop Comput. Geom. pp. 175--178. [PDF]



4. L. Tancredi, M. Teillaud, and O. Devillers. Symbolic Elimination for parallel manipulators, 1996. Note: Communication at 4th Internat. Sympos. on Effective Methods in Algebraic Geometry (MEGA).

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html