Triangulation Based on 3D Reconstruction Technique

Abstract:

For decades of research on triangulation, Scattered surface area triangulation has achieved some results, but a lot of algorithms extended to three-dimensional space still have some problems.In this paper I analyzes the existing algorithms and propose a idea based on the Combination of the incremental method and divide algorithm ,which directly realize the triangulation of scattered points in space. Through the triangulation of space scattered point ,it's result eventually meet the triangular mesh model of the reconstruction and the mesh is very uniform. The model reproduce the object model intuitively and clearly. This study provide meaning of the reference and guide in such a work

• Periodical: Applied Mechanics and Materials (Volumes 121-126)
• Pages: 4249-4253
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.121-126.4249
• Online since: October 2011
• Authors: Zhen Jie Hou, Li Guo Gu
• Keywords: 3D Reconstruction, Divide Algorithm, Incremental Method, Spatial Points, Triangulation

References

[1] Bolle R M, Vemuri B C. On Three-dimensional Surface Reconstruction Methods. IEEE Trans. Pat. Anal. Mach. Intell, 1985 7(4): 431-441.

[2] Watson D F. Computing the N-dimensional Delaunay Tessellation with Application to Voronoi Polytopes . The Computer Journal, 1981, 24(2): 167-172.

DOI: 10.1093/comjnl/24.2.167

[3] Beraridini F, Mittleman J, Silva C, etal. The Ball-pivoting Algorithm for Surface Reconstruction. IEEE Trans. Virsualization Comput . Graphics 1999(4): 43-72.

[4] Lawson GL. Generation of a triangular grid with application to contour plotting[C]. In: Teehnical Memorandum . Institute of Technology , Jet Pollution Laboratory, California, 1972: 294一299.

[5] Lee DT, Sehaeher B J. Two algorithms for eonstrueting a delaunay triangulation[J]. International Journal of Computer and Information Seienees , 1980(9): 219一242.

[6] Dwyer R A. A faster divide-and-conquer algorithm fore constructing Delaunay triangulations [J]. Algorithmica , 1987(2): 137一151.

DOI: 10.1007/bf01840356

[7] Zhu zhanli. Data Struct[M]. XIAN Jiaotong university press, (1999).

[8] Piegl LA, Richard A M. Algorithm and data structure for triangulating multiply connected polyonal domains[J]. Computers & Graphics, 1993, 14(16); 23-35.

DOI: 10.1016/0097-8493(93)90007-v

[9] M. Pollefeys,R. Koch,M. Vergauwen,L. Van Gool ISPRS Journal of Photogrammetry and Remote Sensing, Volume 55, Issue 4, November 2000, Pages 251-267.

DOI: 10.1016/s0924-2716(00)00023-x

[10] FaugerasO, Mourrain B. On the Geometry and Algebra of the Point and Line Correspondences between Images[C].

[11] FaugerasO, Papadopoulo T A. Nonlinear Method for Estimating the Projective Geometry of Three Views [C].

[12] Pollefeys M. Self-calibration and Metric 3D Reconstruction from Uncalibrated Image Sequences [D]: [Ph D Thesis]. Heverlee: Katholieke UniversiteitNijmegen, (1999).

[13] Cipolla R, Robertson D P, BoyerEG. Photobuilder-3DModels of Architectural Scenes from Uncalibrated Images [C].

DOI: 10.1109/mmcs.1999.779115

[14] M. Pollefeys,R. Koch,M. Vergauwen,L. Van Gool ISPRS Journal of Photogram Metry and Remote Sensing, Volume 55, Issue 4, November 2000, Pages 251-267.

DOI: 10.1016/s0924-2716(00)00023-x