| 一种基于拓扑搜索的三角网求交算法 |
| |
| 引用本文： | 尹长林,喻定权. 一种基于拓扑搜索的三角网求交算法[J]. 计算机工程与应用, 2006, 42(36): 209-211 |
| |
| 作者姓名： | 尹长林 喻定权 |
| |
| 作者单位： | 中南大学,信息物理学院,长沙,410083;长沙市规划信息服务中心,长沙,410013;长沙市规划信息服务中心,长沙,410013 |
| |
| 摘 要： | 在地质构模以及各种地下工程设计等三维表达、分析领域,大规模的复杂三角形网的求交计算是三维表面模型建模的一个关键算法。根据三角形网中相邻三角形之间的拓扑邻接关系以及交线的连续性,提出了一种基于拓扑搜索的三角网求交算法。该算法引入空间辅助网格对原始三角网中的三角形进行筛选,并在候选三角形集合中依次追踪、计算构成交线的交线线段,在获得每个交线线段的同时完成了线段之间的连接。实验表明,该算法不仅效率高而且可靠性好。
|
| 关 键 词： | 表面模型 三角网 空间辅助网格 拓扑搜索 |
| 文章编号： | 1002-8331（2006）36-0209-03 |
| 收稿时间： | 2006-04-01 |
| 修稿时间： | 2006-04-01 |
Rapid Topological Searching-based Intersection Algorithm of Triangulated Networks |
| |
| YIN Chang-lin,YU Ding-quan. Rapid Topological Searching-based Intersection Algorithm of Triangulated Networks[J]. Computer Engineering and Applications, 2006, 42(36): 209-211 |
| |
| Authors: | YIN Chang-lin YU Ding-quan |
| |
| Affiliation: | 1.School of Information Physics Engineering,Central South Unversity,Changsha 410083,China; 2.Changsha City Planning Information Service Center,Changsha 410013,China |
| |
| Abstract: | Intersection of large-scale complex triangulated networks is a key algorithm for three dimensional surface modeling in the field of geological modeling and kinds of subsurface engineering design.An intersection algorithm of triangulated networks based on topological searching is proposed according to topological relationship between neighboring triangles and continuity of intersection line,which introduces spatial referenced grid to filter triangles of original triangulated networks,then traces and computes in turn the intersecting segments which compose the intersection line in the set of candidate triangles.Test result shows that the algorithm has good efficiency and reliability. |
| |
| Keywords: | surface model triangulated networks spatial referenced grid topological searching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
