Affiliation:
1. Changzhou University
2. Inner Mongolia Agricultural University
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
Publisher
Trans Tech Publications, Ltd.
Reference14 articles.
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.
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.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献