Algorithm Study of the Models Merge Based on Delaunay Triangulation

Article Preview

Abstract:

It is so valuable that models merging of Delaunay triangulation are used widely in many applications. This paper researches the algorithm of models merging for Delaunay triangulation. A method for obtaining merged intersection lines and a algorithm for searching fast triangles in the extent of merging intersection lines are proposed, and whole process of models merging are expatiated detailedly. The algorithm is tested in experiments, and the result of experiment shows that this algorithm is very efficient.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 734-737)

Pages:

2634-2637

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] W. Xiaobo, W.Shixing:submitted to ACTA GEODAETICA ET CARTOGRAPHIC SINICA(1999)

Google Scholar

[2] X .Qing, C.Ge, Y.Li:submitted to JOURNAL OF IMAGE AND GRAPHICS(2000)

Google Scholar

[3] L. Xue jun, F.Xin sha, Z.Jian san: submitted to CHINA JOURNAL OF HIGHWAY AND TRANSPORT(2000)

Google Scholar

[4] L.Shaohua, C.Peng gen, S.Wen zhong: submitted to Bulletin of Surveying and Mapping(2004)

Google Scholar

[5] P.Hao, S.Zhan feng, Z.Zhen yan: submitted to Journal of The China Railway Society,(2001)

Google Scholar

[6] Y.Jie,L. Pin,Z.Changwen: submitted to Journal of Image and Graphics(2010)

Google Scholar

[7] Z.Yao,F.Hong,H.Wang: submitted to cta Geodaetica et Cartographica Sinica(2012)

Google Scholar