Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (1): 94-96.

• 产品、研发、测试 • Previous Articles     Next Articles

Algorithm of Delaunay triangulation of 3D folded cross-section

WANG Zhan-gang,PAN Mao,QU Hong-gang,WANG Bin   

  1. School of Earth and Spatial Science,Peking University,Beijing 100871,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-01 Published:2008-01-01
  • Contact: WANG Zhan-gang

三维折剖面的Delaunay三角剖分算法

王占刚,潘 懋,屈红刚,王 斌   

  1. 北京大学 地球与空间科学学院,北京 100871
  • 通讯作者: 王占刚

Abstract: Delaunay Triangulation(DT) by projection for 3D Folded Cross-Section(3DFCS),even created from boreholes,met three problems:(1)defying DT rules;(2)Hanging Triangles;(3)Folded-back problem.By analyzing 3DFCS data structure and geometry characterization,a new method of section-expanding is presented in this paper.This method can expand 3DFCS to 2D Flat Cross-Section(FCS) and assure the distance invariance of two points and the topological invariance of the 3D Arcs and Polygons in 3DFCS.FCS is comprised of 2D polygons and can fully use 2D constrained Delaunay triangulation algorithms.

Key words: 3D, folded cross-section, delaunay triangulation, geology modeling

摘要: 三维折剖面Delaunay三角剖分在三维地质建模和其他领域具有广泛应用。目前常用的方法是将其投影到二维平面三角剖分。该方法有三点不足:(1)违反Delaunay三角剖分优化准则;(2)悬三角形问题;(3)投影多值问题。通过研究分析三维折剖面的数据组织以及几何特点,提出了折剖面“展开”剖分方法,即将三维折剖面的三角剖分转化为二维平剖面的剖分。该方法具有点之间的水平距离以及原剖面数据拓扑关系不变的优点,很好地解决了折剖面投影三角剖分的不足。

关键词: 三维, 折剖面, Delaunay三角剖分, 地质建模