Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
暂无分享,去创建一个
[1] J. A. Riley,et al. THE SKELETONS OF STABLE PLANE SETS. , 1967 .
[2] Rex A. Dwyer. Higher-dimensional voronoi diagrams in linear expected time , 1991, Discret. Comput. Geom..
[3] Rex A. Dwyer,et al. The Expected Number of k-Faces of a Voronoi Diagram , 1993 .
[4] E. V. Anoshkina,et al. Ridges, Ravines and Singularities , 1997 .
[5] Timothy M. Chan,et al. Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams , 1997, Discret. Comput. Geom..
[6] Hwan Pyo Moon,et al. MATHEMATICAL THEORY OF MEDIAL AXIS TRANSFORM , 1997 .
[7] M. Bern,et al. Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.
[8] Nina Amenta,et al. The medial axis of a union of balls , 2001, Comput. Geom..
[9] Hyeon-Suk Na,et al. On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes , 2003, Comput. Geom..
[10] Jean-Daniel Boissonnat,et al. Natural neighbor coordinates of points on a surface , 2001, Comput. Geom..
[11] Jeff Erickson,et al. Nice Point Sets Can Have Nasty Delaunay Triangulations , 2001, SCG '01.
[12] Hyeon-Suk Na,et al. The probabilistic complexity of the Voronoi diagram of points on a polyhedron , 2002, SCG '02.
[13] Csaba D. Tóth. Art galleries with guards of uniform range of vision , 2002, Comput. Geom..
[14] Jean-Daniel Boissonnat,et al. Smooth surface reconstruction via natural neighbour interpolation of distance functions , 2002, Comput. Geom..
[15] Jean-Daniel Boissonnat,et al. A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces , 2004, Discret. Comput. Geom..