Browse > Article
http://dx.doi.org/10.22710/JICT.2020.10.1.007

An Efficient Polygonal Surface Reconstruction  

Park, Sangkun (Department of Mechanical Engineering, Korea National University of Transportation)
Publication Information
Journal of Institute of Convergence Technology / v.10, no.1, 2020 , pp. 7-12 More about this Journal
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
polygonal surface; 3D convex hull; signed distance function; marching cubes; surface reconstruction;
Citations & Related Records
연도 인용수 순위
  • Reference
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.   DOI
5 https://github.com/mauriciopoppe/quickhull3d
6 https://github.com/vanruesc/sparse-octree
7 W. Lorensen and H. Cline, "Marching cubes: A high resolution 3d surface reconstruction algorithm", SIGGRAPH, pp.163-169, 1987.
8 S. Park, "A Polygonal Surface Reconstruction from Oriented Point Set", Korean J. of Comput. Des. Eng., In press, 2020.
9 Y. Ohtake, A. Belyaev, M. Alexa, G. Turk, and H. Seidel, "Multi-level partition of unity implicits", TOG, pp.463-470, 2003.