首页 | 本学科首页   官方微博 | 高级检索  
     检索      

3维离散数据四面体快速生成算法研究
引用本文:钟正,樊启斌,张叶挺.3维离散数据四面体快速生成算法研究[J].测绘学院学报,2004,21(4):286-288,291.
作者姓名:钟正  樊启斌  张叶挺
作者单位:[1]武汉大学测绘遥感信息工程国家重点实验室,湖北武汉430079 [2]武汉大学数学与统计学院,湖北武汉430072
摘    要:文中系统地研究了使用逐点插入算法构建3维离散数据四面体模型中的几个关键问题,提出了动态创建和维护四面体拓扑关系的方法,建立了快速确定点在四面体中的算法原理及空外接球判断法则的简易表达式,实验分析证明本算法有着较高的执行效率,算法复杂度与点数几乎成线性关系。

关 键 词:3维离散数据  3维Delaunay四面体网格  四面体拓扑关系

Algorithm for Fast Constructing Tetrahedral Network From Three Dimensional Dispersed Data
ZHONG Zheng,FAN Qi-bin,ZHANG Ye-ting g,Mapping and Remote Sensing,Wuhan University,Wuhan,China, .School Of Mathematics and Statistics,Wuhan University,Wuhan,China.Algorithm for Fast Constructing Tetrahedral Network From Three Dimensional Dispersed Data[J].Journal of Institute of Surveying and Mapping,2004,21(4):286-288,291.
Authors:ZHONG Zheng  FAN Qi-bin  ZHANG Ye-ting g  Mapping and Remote Sensing  Wuhan University  Wuhan    China  School Of Mathematics and Statistics  Wuhan University  Wuhan    China
Institution:ZHONG Zheng~1,FAN Qi-bin~2,ZHANG Ye-ting~1 g,Mapping and Remote Sensing,Wuhan University,Wuhan,430079,China, 2.School Of Mathematics and Statistics,Wuhan University,Wuhan,430072,China)
Abstract:This paper studies some key procedures that hold up the efficiency of tetrahedral network based on Delaunay(DTEN). A algorithm for dynamically renewing the topological relations in DTEN is represented. The paper also studies the way of finding tetrahedral network that contains a given point in DTEN and the formula of empty circum-sphere test. The incremental insertion algorithm of constructing DTEN, has a time complexity that is about linear to the number of points set.
Keywords:three dimensional dispersed data  tetrahedral network based on three-dimensional Delaunay  tetrahedral topological relation
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号