, Complexity of Delaunay triangulation for points on lower-dimensional polyhedra, Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA), 2007.
URL : https://hal.archives-ouvertes.fr/inria-00182835
, A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces, Discrete and Computational Geometry, vol.31, issue.3, pp.369-384, 2004.
DOI : 10.1007/s00454-003-2870-4
URL : https://hal.archives-ouvertes.fr/inria-00072135
, Complexity of the delaunay triangulation of points on surfaces the smooth case, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.201-210, 2003.
DOI : 10.1145/777792.777823
, A Practical Delaunay Meshing Algorithm for a Large Class of Domains*, Proceedings of the 16th International Meshing Roundtable, pp.477-494, 2007.
DOI : 10.1007/978-3-540-75103-8_27
, The probability that a numerical analysis problem is difficult, Mathematics of Computation, vol.50, issue.182, pp.449-480, 1988.
DOI : 10.1090/S0025-5718-1988-0929546-7
, Nice Point Sets Can Have Nasty Delaunay Triangulations, Discrete and Computational Geometry, vol.30, issue.1, pp.109-132, 2003.
DOI : 10.1007/s00454-003-2927-4
URL : http://arxiv.org/abs/cs/0103017
, The probabilistic complexity of the Voronoi diagram of points on a polyhedron, Proceedings of the eighteenth annual symposium on Computational geometry , SCG '02, pp.209-216, 2002.
DOI : 10.1145/513400.513426
, On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes, Computational Geometry, vol.25, issue.3, pp.197-231, 2003.
DOI : 10.1016/S0925-7721(02)00123-2
, Stratified spaces twigs. TWIGS talks
, Any open bounded subset of has the same homotopy type as its medial axis, Computer-Aided Design, vol.36, issue.11, pp.1029-1046, 2004.
DOI : 10.1016/j.cad.2004.01.011
, The maximum numbers of faces of a convex polytope, Mathematika, vol.16, issue.02, pp.179-184, 1970.
DOI : 10.1007/BF02771542