Seed Polytopes for Incremental Approximation
暂无分享,去创建一个
G. Rote | F. Aurenhammer | G. Vegter | O. Aichholzer | T. Hackl | Simon Plantinga | A. Sturm | B. Kornberger | S. Plantinga | Bernhard Kornberger
[1] Gert Vegter,et al. Envelope surfaces , 2006, SCG '06.
[2] Tamal K. Dey,et al. Curve and Surface Reconstruction , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[3] Dinesh Manocha,et al. Efficient computation of a simplified medial axis , 2003, SM '03.
[4] Nina Amenta,et al. Accurate and efficient unions of balls , 2000, SCG '00.
[5] Marshall W. Bern,et al. Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.
[6] Dominique Attali,et al. Computing and Simplifying 2D and 3D Continuous Skeletons , 1997, Comput. Vis. Image Underst..
[7] Franz Aurenhammer,et al. Improved Algorithms for Discs and Balls Using Power Diagrams , 1988, J. Algorithms.
[8] Günter Rote,et al. Convex Approximation by Spherical Patches , 2007 .
[9] F. Aurenhammer,et al. Approximating Boundary-Triangulated Objects with Balls , 2007 .
[10] Herbert Edelsbrunner,et al. Deformable Smooth Surface Design , 1999, Discret. Comput. Geom..
[11] Gert Vegter,et al. In handbook of discrete and computational geometry , 1997 .