, Voronoi diagrams---a survey of a fundamental geometric data structure, ACM Computing Surveys, vol.23, issue.3, pp.345-405, 1991.
DOI : 10.1145/116873.116880
, Voronoi diagrams, Handbook of computational geometry, pp.201-290, 1999.
, An exact, complete and efficient implementation for computing planar maps of quadric intersection curves, Proceedings of the twenty-first annual symposium on Computational geometry , SCG '05, pp.99-115, 2005.
DOI : 10.1145/1064092.1064110
, Triangulations in CGAL, Computational Geometry, vol.22, issue.1-3, pp.5-19, 2002.
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408
, Applications of random sampling to on-line algorithms in computational geometry, Discrete & Computational Geometry, vol.20, issue.1, pp.51-71, 1992.
DOI : 10.1007/BF02293035
URL : https://hal.archives-ouvertes.fr/inria-00075274
, Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams, Discrete & Computational Geometry, vol.18, issue.4, pp.433-454, 1997.
DOI : 10.1007/PL00009327
, Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, pp.387-421, 1989.
, A course in computational algebraic number theory, Graduate Texts in Mathematics, vol.138, issue.3, 1996.
DOI : 10.1007/978-3-662-02945-9
, Computing the Medial Axis of a Polyhedron Reliably and Efficiently, 2000.
, Approximate medial axis as a voronoi subcomplex, SMA '02: Proceedings of the seventh ACM symposium on Solid modeling and applications, pp.356-366, 2002.
, Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm, Journal of Symbolic Computation, vol.43, issue.3, 2005.
DOI : 10.1016/j.jsc.2007.10.006
URL : https://hal.archives-ouvertes.fr/inria-00071229
, Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils, Journal of Symbolic Computation, vol.43, issue.3, 2005.
DOI : 10.1016/j.jsc.2007.10.012
URL : https://hal.archives-ouvertes.fr/inria-00071228
, Computing Voronoi skeletons of a 3-D polyhedron by space subdivision, Computational Geometry, vol.21, issue.3, pp.87-120, 2002.
DOI : 10.1016/S0925-7721(01)00056-6
, Voronoi diagrams and delaunay triangulations In Handbook of discrete and computational geometry, pp.377-388, 1997.
, Fast computation of generalized Voronoi diagrams using graphics hardware, Annual Conference Series) Proceedings of ACM SIGGRAPH, pp.277-286, 1999.
, A robust and efficient implementation for the segment voronoi diagram, International Symposium on Voronoi Diagrams in Science and Engineering, pp.51-62, 2004.
, Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: I???representations, Computer Aided Geometric Design, vol.16, issue.9, pp.841-859, 1999.
DOI : 10.1016/S0167-8396(99)00032-1
, Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations, Proceedings of the eighteenth annual symposium on Computational geometry , SCG '02, pp.616-642, 2003.
DOI : 10.1145/513400.513427
, Semialgebraic Sard Theorem for Generalized Critical
Values, Journal of Differential Geometry, vol.56, issue.1, pp.67-92, 2000.
DOI : 10.4310/jdg/1090347525
, Intersection and proximity problems and voronoi diagrams, Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics, pp.187-228, 1987.
, Robust construction of the voronoi diagram of a polyhedron, Proceedings of the 5th Canadian Conference on Computational Geometry (CCCG'93), pp.473-478, 1993.
, On the computation of an arrangement of quadrics in 3D, Special issue, 19th European Workshop on Computational Geometry, pp.145-164, 2005.
DOI : 10.1016/j.comgeo.2004.05.003
URL : https://hal.archives-ouvertes.fr/inria-00350858
, Spatial Tessellations -Concepts and Applications of Voronoi Diagrams, 2000.
, Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation, Journal of Complexity, vol.16, issue.4, pp.716-750, 2000.
DOI : 10.1006/jcom.2000.0563
URL : https://hal.archives-ouvertes.fr/inria-00107845
, Generalized critical values and testing sign conditions on a polynomial, Proceedings of Mathematical Aspects of Computer and Information Science, pp.61-84, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01351457
, Polar varieties and computation of at least one point in each connected component of a smooth real algebraic set, Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'03), pp.224-231, 2003.
, Properness defects of projections and computation of one point in each connected component of a real algebraic set, Discrete and Computational Geometry, vol.32, issue.3, pp.417-430, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099962
, An exact and efficient approach for computing a cell in an arrangement of quadrics, Computational Geometry, vol.33, issue.1-2, pp.65-97, 2006.
DOI : 10.1016/j.comgeo.2004.02.007
, Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications, Proceedings of the twelfth annual symposium on Computational geometry , SCG '96, pp.269-288, 1997.
DOI : 10.1145/237218.237230
, Studio sulle quadriche in uno spazio lineare ad un numero qualunque di dimensioni, pp.3-86, 1883.
, A convex hull algorithm optimal for point sets in even dimensions, 1981.
, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete & Computational Geometry, vol.6, issue.3, pp.327-345, 1994.
DOI : 10.1007/BF02574384
, Polygonal approximation of voronoi diagrams of a set of triangles in three dimensions, Laboratory of Computer Science, 1997.