Surface Extraction from Point-Sampled Data through Region Growing

  • Vieira, Miguel (Mechanical Engineering Department, Carnegie Mellon University) ;
  • Shimada, Kenji (Mechanical Engineering Department, Carnegie Mellon University)
  • 발행 : 2005.12.01

초록

As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.

키워드

참고문헌

  1. A. Adamson and M. Alexa (2003), Ray Tracing Point Set Surfaces, Proceedings of Shape Modeling International, 272-279
  2. A. Adamson and M. Alexa (2003), Approximating and Intersecting Surfaces from Points, Proceedings of EUROGRAPHICS, 245-254
  3. A. Adamson and M. Alexa (2004), Approximating Bounded, Non-Orientable Surfaces from Points, Proceedings of Shape Modeling International, 243-252 https://doi.org/10.1109/SMI.2004.1314511
  4. M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. Silva (2001), Point Set Surfaces, IEEE Visualization, 21-28
  5. N. Amenta, M. Bern and M. Kamvysselis (1998), A New Voronoi-Based Surface Reconstruction Algorithm, Proceedings of SIGGRAPH, 415-422
  6. M. Attene and M. Spagnuolo (2000), Automatic Surface Reconstruction from Point Sets in Space, Proceedings of EUROGRAPHICS,457-465
  7. C. Bajaj, F. Bernardini and G. Xu (1995), Automatic Reconstruction of Surfaces and Scalar Fields from 3D Scans, Proceedings of SIGGRAPH, 109-118 https://doi.org/10.1145/218380.218424
  8. P. Benko and T. Varady (2002), Direct Segmentation of Smooth, Multiple Point Regions, Proceedings of Geometric Modeling and Processing, 169-178 https://doi.org/10.1109/GMAP.2002.1027508
  9. P. Benko and T. Varady (2004), Segmentation Methods for smooth point regions of conventional engineering objects, Computer-Aided Design, 36(6), 511-523 https://doi.org/10.1016/S0010-4485(03)00159-3
  10. P. Besl (1988), Surfaces in Range Image Understanding, Springer-Verlag
  11. P. Besl and R. Jain (1988), Segmentation Through Variable-Order Surface Fitting, IEEE Transactions on Pattern Analysis and Machine Intelligence, 167-192 https://doi.org/10.1109/34.3881
  12. J. C. Carr, R. K. Beatson, J. B. Cherrie, T. J. Mitchell, W. R. Fright, B. C. McCallum, and T. R. Evans (2001), Reconstruction and Representation of 3D Objects with Radial Basis Functions, Proceedings of SIGGPRAH, 67-76
  13. B. Curless and M. Levoy (1996), A Volumetric Method for Building Complex Models from Range Image, SIGGRAPH, 303-312 https://doi.org/10.1145/237170.237269
  14. M. de Berg, M. van Krevald, M. Overmars, and O. Schwarzkopf, Computational Geometry
  15. M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, and W. Stuetzle (1995), Multiresolution Analysis of Arbitrary Meshes, Proceedings of SIGGRAPH, 173-182 https://doi.org/10.1145/218380.218440
  16. M. Eck and H. Hoppe (1996), Automatic Reconstruction of B-Spline Surface of Arbitrary Topological Type, Proceedings of SIGGRAPH, 325-334 https://doi.org/10.1145/237170.237271
  17. G. Farin (2002), Curves and Surfaces for CAGD, Academic Press, A Harcourt Science and Technology Company
  18. S. Gumhold, X. Wang, and R. MacLeod (2001), Feature Extraction from Point Clouds, Proceedings of the 10th Int. Meshing Roundtable
  19. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle (1992), Surface Reconstruction from Unorganized Points, SlGGRAPH, 71-78 https://doi.org/10.1145/133994.134011
  20. H. Hoppe, T. DeRose, T. Duchamp, M. Halstead, H. Jin, J. McDonald, J. Schweitzer, and W. Stuetzle (1994), Piecewise Smooth Surface Reconstruction, Proceedings of SIGGRAPH,295-302 https://doi.org/10.1145/192161.192233
  21. J. Huang and C.-H. Menq (2001), Automatic Data Segmentation for Geometric Feature Extraction from Unorganized 3-D Coordinate Points, IEEE Transactions on Robotics and Automation, 268-279 https://doi.org/10.1109/70.938384
  22. J. Huang and C.-H. Menq (2002), Automatic CAD Model Reconstruction from Multiple Point Clouds for Reverse Engineering, Journal of Computing and Information Science in Engineering, 160-170 https://doi.org/10.1115/1.1529210
  23. M. Levoy and T. Whitted (1985), The Use of Points as a Display Primitive, University of North Carolina at Chapel Hill Tech. Rept., TR 85-022
  24. B. Levy, S. Petitjean, N. Ray, and J. Maillot (2002), Least Squares Conformal Maps for Automatic Texture Atlas Generation, Proceedings of SIGGRAPH, 362-371 https://doi.org/10.1145/566654.566590
  25. W. Ma and J. P. Kruth (1995), Parameterization of randomly measured points for least squares fitting of B-spline curves and surfaces, Computer-Aided Design, 27(9), 663-675 https://doi.org/10.1016/0010-4485(94)00018-9
  26. Y. Ohtake, A. Belyaev, M. Alexa, G. Turk and H.-P. Seidel (2003), Multi-Level Partition of Unity Implicits, Proceedings of SIGGRAPH, 463-470 https://doi.org/10.1145/1201775.882293
  27. Y. Ohtake, A. Belyaev and H.-P. Seidel (2004), 3D Scattered Data Approximation with Adaptive Compactly Supported Radial Basis Functions, Shape Modeling International, 31-39 https://doi.org/10.1109/SMI.2004.1
  28. M. Pauly and M. Gross (2001), Spectral Processing of Point-Sampled Geometry, Proceedings of SIGGRAPH, 379-386 https://doi.org/10.1145/383259.383301
  29. M. Pauly, M. Gross and L. Kobbelt (2002), Efficient Simplification of Point-Sampled Geometry, IEEE Visualization
  30. M. Pauly, R. Keiser and M. Gross (2003), Multi-scale Feature Extraction on Point-Sampled Surfaces, EUROGRAPHICS
  31. H. Pfister, M. Zwicker, J. v. Baar and M. Gross (2000), Surfels: Surface Elements as Rendering Primitives, Proceedings of SIGGRAPH, 335-342 https://doi.org/10.1145/344779.344936
  32. L. Piegl and W. Tiller (1997), The NURBS Book, Springer-Verlag
  33. W. Press, S. Teukolsky, W. Vetterling and B. Flannery (1997), Numerical Recipes in C, Second Edition, Cambridge University Press
  34. S. Rusinkiewicz and M. Levoy (2000), QSplat: A Multiresolution Point Rendering System for Large Meshes, Proceedings of SIGGRAPH, 343-352 https://doi.org/10.1145/344779.344940
  35. H. Samet (1990), Applications of Spatial Data Structures, Addison-Wesley
  36. N. Sapidis and P. Besl (1995), Direct Construction of Polynomial Surfaces from Dense Range Images through Region Growing, ACM Transactions on Graphics, 171-200 https://doi.org/10.1145/221659.221672
  37. B. Sarkar and C.-H. Menq (1991), Parameter Optimization in Approximating Curves and Surfaces to Measurement Data, Computer Aided Geometric Design, 267-290 https://doi.org/10.1016/0167-8396(91)90016-5
  38. M. Vieira and K. Shimada (2004), Surface Mesh Segmentation and Smooth Surface Extraction Through Region Growing, Computer Aided Geometric Design, (in print) https://doi.org/10.1016/j.cagd.2005.03.006
  39. M. Vieira and K. Shimada (2004), Segmentation of Noisy Laser-Scanner Generated Meshes with Piecewise Polynomial Approximations, Proceedings of the ASME Design Automation Conference