Browse > Article
http://dx.doi.org/10.6109/jkiice.2016.20.3.513

Fast 3D mesh generation using projection for line laser-based 3D Scanners  

Lee, Kyungme (Department of Computer Science, Graduate School, Sangmyung University)
Yoo, Hoon (Department of Media Software, Sangmyung University)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.20, no.3, 2016 , pp. 513-518 More about this Journal
Abstract
This paper presents a fast 3D mesh generation method using projection for line laser-based 3D scanners. The well-known method for 3D mesh generation utilizes convex hulls for 4D vertices that is converted from the input 3D vertices. This 3D mesh generation for a large set of vertices requires a lot of time. To overcome this problem, the proposed method takes (${\theta}-y$) 2D depth map into account. The 2D depth map is a projection version of 3D data with a form of (${\theta}$, y, z) which are intermediately acquired by line laser-based 3D scanners. Thus, our 2D-based method is a very fast 3D mesh generation method. To evaluate our method, we conduct experiments with intermediate 3D vertex data from line-laser scanners. Experimental results show that the proposed method is superior to the existing method in terms of mesh generation speed.
Keywords
2D depth map; 3D scanner; Line laser scanner; Mesh generation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. Varady, R. Martin, and J Cox, "Reverse engineering of geometric models-an introduction," Computer-Aided Design. Elsevier, vol.29, no.4, pp.255-268, Apr. 1997.   DOI
2 K. Ho-Le, "Finite element mesh generation methods: a review and classification," Computer-aided design. Elsevier, vol.20, no.1, pp.27-38, Jan. 1988.   DOI
3 S. Devadoss, and J. O'Rourke, Discrete and computational geometry, Princeton University Press, 2011.
4 B. Wordenweber, "Finite element mesh generation," Computer-Aided Design. Elsevier, vol.19, no.5, pp.285-291, Sep. 1984.
5 H. Samet, "The quadtree and related hierarchical data structures," ACM Computing Surveys (CSUR). ACM, vol.16, no.2, pp.187-260, Jan. 1984.   DOI
6 M. Yerry, and M. Shephard, "Automatic threedimensional mesh generation by the modified-octree technique," International Journal for Numerical Methods in Engineering, vol.20, no.11, pp.1965-1990, Nov. 1984.   DOI
7 AC de Oliveira Miranda, and L. Martha, "Hierarchical template-based quadrilateral mesh generation," Engineering with Computers. Springer, pp.1-15, Jan. 2015.
8 J. Boissonnat, C. Wormser, and M. Yvinec, "Anisotropic Delaunay mesh generation," SIAM Journal on Computing, vol.44, no.2, pp. 467-512, Feb. 2015.   DOI
9 P. Su, and R. Drysdale, "A comparison of sequential Delaunay triangulation algorithms," Proceedings of the eleventh annual symposium on Computational geometry. ACM, pp.61-70, Sep. 1995.
10 B. Joe, "Construction of three-dimensional Delaunay triangulations using local transformations," Computer Aided Geometric Design. Elsevier, vol.8, no.2, pp.123-142, May. 1991.   DOI
11 M. Facello, "Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions," Computer Aided Geometric Design. Elsevier, vol.12, no.4, pp.349-370, Jun. 1995.   DOI
12 P. Cignoni, C. Montani, and R. Scopigno, "DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed," Computer-Aided Design. Elsevier, vol.30, no.5, pp.333-341, Apr. 1998.   DOI
13 B. Barber, D. Dobkin, and H. Huhdanpaa, "The quickhull algorithm for convex hulls," ACM Transactions on Mathematical Software (TOMS). ACM, vol.22, no.4, pp.469-483, Dec. 1996.   DOI
14 V. Rajan, "Optimality of the Delaunay triangulation in $R^d$," Discrete & Computational Geometry. Springer, vol.12, no.2, pp.189-202, Dec. 1994.   DOI