DOI QR코드

DOI QR Code

An Efficient Polygonal Surface Reconstruction

효율적인 폴리곤 곡면 재건 알고리즘

  • Park, Sangkun (Department of Mechanical Engineering, Korea National University of Transportation)
  • 박상근 (한국교통대학교 기계공학)
  • Received : 2020.08.25
  • Accepted : 2020.10.30
  • Published : 2020.11.30

Abstract

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

Keywords

References

  1. M. Kazhdan, M. Bolitho, and H. Hoppe, "Poisson surface reconstruction", Symposium on Geometry Processing, pp. 61-70, 2016.
  2. https://web.cs.ucdavis.edu/-amenta/powercrust.html
  3. M. Kazhdan, and H. Hoppe, "Screened Poisson surface reconstruction", ACM Trans. Graphics, 32(3), 2013.
  4. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, "Surface reconstruction from unorganized point", Computer Graphics, 26, pp.71-78, 1992. https://doi.org/10.1145/142920.134011
  5. Y. Ohtake, A. Belyaev, M. Alexa, G. Turk, and H. Seidel, "Multi-level partition of unity implicits", TOG, pp.463-470, 2003.
  6. https://github.com/mauriciopoppe/quickhull3d
  7. https://github.com/vanruesc/sparse-octree
  8. W. Lorensen and H. Cline, "Marching cubes: A high resolution 3d surface reconstruction algorithm", SIGGRAPH, pp.163-169, 1987.
  9. S. Park, "A Polygonal Surface Reconstruction from Oriented Point Set", Korean J. of Comput. Des. Eng., In press, 2020.