A new point cloud simplification algorithm
暂无分享,去创建一个
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[3] Yehoshua Y. Zeevi,et al. The farthest point strategy for progressive image sampling , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5).
[4] James A. Sethian,et al. Level Set Methods and Fast Marching Methods , 1999 .
[5] Matthias Zwicker,et al. Surfels: surface elements as rendering primitives , 2000, SIGGRAPH.
[6] Marc Alexa,et al. Point set surfaces , 2001, Proceedings Visualization, 2001. VIS '01..
[7] Jean-Daniel Boissonnat,et al. Coarse‐to‐fine surface simplification with geometric guarantees , 2001, Comput. Graph. Forum.
[8] Tamal K. Dey,et al. Decimating samples for mesh simplification , 2001, CCCG.
[9] Lars Linsen,et al. Point cloud representation , 2001 .
[10] F. Mémoli,et al. Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730 , 2001 .
[11] F. Mémoli,et al. Distance functions and geodesics on points clouds , 2002 .
[12] Markus Gross,et al. Multiresolution modeling of point-sampled geometry , 2002 .
[13] Sunghee Choi,et al. A Simple Algorithm for Homeomorphic Surface Reconstruction , 2002, Int. J. Comput. Geom. Appl..
[14] Markus H. Gross,et al. Efficient simplification of point-sampled surfaces , 2002, IEEE Visualization, 2002. VIS 2002..
[15] Carsten Moenning,et al. Fast Marching farthest point sampling for implicit surfaces and point clouds , 2003 .