A progressive point cloud simplification algorithm with preserved sharp edge data

International Journal of Advanced Manufacturing Technology

Volumn 45, Issue 5-6, 2009, Pages 583-592

  Song, Hao ^a   Feng, Hsi Yung ^b  

^a Virtualwind Inc   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

3D laser scanning; Data reduction; Edge points; Local geometry representation; Point cloud data

Indexed keywords

3-D SHAPE; 3D LASER SCANNING; BOUNDARY SURFACES; COMPUTATIONAL CHALLENGES; DATA POINTS; EDGE POINT; EDGE POINTS; HIGH-SPEED; LASER SCANNING; LOCAL GEOMETRY REPRESENTATION; LOCAL SURFACES; MECHANICAL PARTS; NUMBER OF DATUM; PHYSICAL OBJECTS; POINT CLOUD; POINT CLOUD DATA; SHARP EDGES; SIMPLIFICATION ALGORITHMS;

ALGORITHMS; COMPUTATIONAL GEOMETRY; DATA PROCESSING; LASER APPLICATIONS; LASERS; SCANNING; SET THEORY; STATISTICS; SURFACE CHEMISTRY; THREE DIMENSIONAL;

DATA REDUCTION;

EID: 70449532385     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-009-1980-4     Document Type: Article

References (22)

1. T Varady RR Martin J Cox 1997 Reverse engineering of geometric models-an introduction Computer-Aided Des 29 4 255 268 10.1016/S0010-4485(96)00054-1
2. Lorensen WE, Cline HE (1987) Marching cubes: a high resolution 3D surface construction algorithm. In: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH'87), pp. 163-169
3. S Fleishman D Cohen-Or M Alexa CT Silva 2003 Progressive point set surfaces ACM Trans Graph 22 4 997 1011 10.1145/944020.944023
4. N Amenta YJ Kil 2004 Defining point-set surfaces ACM Trans Graph 23 3 264 270 10.1145/1015706.1015713 (Pubitemid 40163714)
5. Hoschek J, Dietz U, Wilke W (1997) A geometric concept of reverse engineering of shape: approximation and feature lines. In: Proceedings of the International Conference on Mathematical Methods for Curves and Surfaces II, Lillehammer, Norway, pp. 253-262
6. Pauly M, Gross M, Kobbelt LP (2002) Efficient simplification of point-sampled surfaces. In: Proceedings of the 13th IEEE Visualization Conference, Boston, MA, pp 163-170
7. DP Luebke 2001 A developer's survey of polygonal simplification algorithms IEEE Comput Graph Appl 21 3 24 35 10.1109/38.920624
8. P Cignoni C Montani R Scopigno 1998 A comparison of mesh simplification algorithms Comput Graph 22 1 37 54 10.1016/S0097-8493(97)00082-4
9. Pauly M, Gross M (2001) Spectral processing of point-sampled geometry. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH'01), pp. 379-386
10. Moenning C, Dodgson NA (2004) Intrinsic point cloud simplification. In: Proceedings of the 14th International Conference on Computer Graphics and Vision (GraphiCon), Moscow, Russia
11. Y Eldar M Lindenbaum M Porat YY Zeevi 1997 The farthest point strategy for progressive image sampling IEEE Trans Image Process 6 9 1305 1315 10.1109/83.623193
12. Linsen L (2001) Point cloud representation. Technical Report, Faculty of Informatics, University of Karlsruhe, Germany
13. Alexa M, Behr J, Cohen-Or D, Fleishman S, Levin D, Silva CT (2001) Point set surfaces. In: Proceedings of the IEEE Conference on Visualization (VIS'01), pp. 21-28
14. Levin D (2004) Mesh-independent surface interpolation. In: Brunnett G, Hamann B, Muller H, Linsen L (eds.) Geometric Modeling for Scientific Visualization, Springer, pp. 37-49
15. A Kalaiah A Varshney 2003 Modeling and rendering of points with local geometry IEEE Trans Vis Comput Graph 9 1 30 42 10.1109/TVCG.2003.1175095
16. KH Lee H Woo T Suk 2001 Point data reduction using 3D grids Int J Adv Manuf Technol 18 3 201 210 10.1007/s001700170075 (Pubitemid 32914706)
17. K Demarsin D Vanderstraeten T Volodine D Roose 2007 Detection of closed sharp edges in point clouds using normal estimation and graph theory Computer-Aided Des 39 3 276 283 10.1016/j.cad.2006.12.005 (Pubitemid 46560482)
18. H Song HY Feng D OuYang 2008 Automatic detection of tangential discontinuities in point cloud data ASME J Comput Inf Sci Eng 8 2 021001:1 10
19. D OuYang HY Feng 2005 On the normal vector estimation for point cloud data from smooth surfaces Computer-Aided Des 37 10 1071 1079 10.1016/j.cad.2004.11.005 (Pubitemid 40480158)
20. JD Boissonnat O Devillers S Pion M Teillaud M Yvinec 2002 Triangulations in CGAL Comput Geom Theory Appl 22 1-3 5 19 1016.68138 1893651
21. Devillers O, Teillaud M (2003) Perturbations and vertex removal in a 3D Delaunay triangulation. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 313-319
22. H Song HY Feng 2008 A global clustering approach to point cloud simplification with a specified data reduction ratio Computer-Aided Des 40 3 281 292