基于Delaunay三角网的模型拼合算法研究  

Research on Models Merge Algorithm Based on Delaunay Triangulation

作　　者：程朋根[1] 刘少华[1] 龚健雅[2] 潭福初[1] 

机构地区：[1]东华理工学院测量系,抚州344000 [2]武汉大学测绘与遥感信息工程国家重点实验室,武汉430079

出　　处：《中国图象图形学报（A辑）》2004年第4期451-455,共5页Journal of Image and Graphics

基　　金：测绘遥感信息工程国家重点实验室开放研究基金资助项目(WKL(01)0302);国家"973"资助项目(G2000077904);香港理工大学科研基金资助项目(B.34.37.Q238)

摘　　要：模型拼合在地理建模、铁 (公 )路路线三维设计等领域应用十分广泛 ,研究如何快速高效地获得拼合模型的算法很有必要。基于 Delaunay三角网模型的拼合算法 ,提出了一种快速获取模型拼合交线的方法和快速搜索交线范围内三角形的算法 ,采取拼合交线入网及初始 D-三角网的裁剪 2个关键步骤来实现 D-三角网模型拼合。对模型拼合的整个过程进行了详细的阐述 ,采用 VC+ + 6 .0语言实现了算法 ,并利用实验数据对算法进行测试 。Models merging is widely used in many domains such as geography modeling, 3D design of highway and railway route and so on, so it is essential to design an efficient models merging algorithm. The objective of this paper is to research on models merging algorithm based on Delaunay triangulation. A method of obtaining model merged intersection lines quickly and an algorithm of searching triangles on the inside of the intersection lines fast are proposed. For the purpose of implementing Delaunay triangulation models mergence, two main steps, such as insert the merged intersection lines into the Initial Delaunay Triangulation (IDT), and cut the triangles inside of the intersection lines in IDT out, are adopted. The processes of models merging are expatiated detailedly. The proposed algorithms are implemented by using VC++ programming language and tested by some experimental data. The experimental result validated the correctness and feasibility about the proposed algorithms.

关 键 词：DELAUNAY三角网 裁剪 模型拼合算法 三维设计 图像处理 

分 类 号：TN911.73[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]