| 改进Delaunay生长算法研究 |
| |
| 引用本文： | 张渭军.改进Delaunay生长算法研究[J].测绘科学,2011,36(4):58-59. |
| |
| 作者姓名： | 张渭军 |
| |
| 作者单位： | 长安大学地球科学与资源学院,西安,710054 |
| |
| 基金项目： | 国家自然科学基金，中央高校基本科研业务费专项基金，长安大学基础研究支持计划专项基金 |
| |
| 摘 要： | 本文在Delaunay-三角网的特性及其生成算法基础上,针对分割-归并算法、逐点插入法的局限性,在生长算法的基础上提出一种改进生长算法,随着Delaunay-三角网生成过程,该算法通过设置动态点链表,使点链表中的可用点逐渐减少从而节省时间,其次针对原算法中三角形有两种可扩展边的可能,每次都取边表中最后压入的边为基边来生...
|
| 关 键 词： | Delaunay-三角网 分割-归并算法 逐点插入法 生长算法 点链表 |
Improved Delaunay giftwrapping algorithms |
| |
| ZHANG Wei-jun.Improved Delaunay giftwrapping algorithms[J].Science of Surveying and Mapping,2011,36(4):58-59. |
| |
| Authors: | ZHANG Wei-jun |
| |
| Institution: | ZHANG Wei-jun(School of Earth Science and Resources,Chang’an University,Xi’an 710054,China) |
| |
| Abstract: | To efficiently establish Delaunay-triangulation,the paper introduced its properties and classification algorithm and presented an improved algorithm on the base of giftwrapping algorithms for the limitation of divide-conquer and incremental algorithms.With the generative process of Delaunay,the improved algorithm instituted dynamic point-list and made the usable points decreasing and saved the time.Second,finding the last pressed edge from the edge-list and making it giftwrapping edge,the improved algorithm made the triangle giftwrapping from the third edge against the other two possible edges.The result proved the improved that the giftwrapping algorithm was feasible. |
| |
| Keywords: | Delaunay-triangulation divide-conquer algorithms incremental algorithms giftwrapping algorithms point-list |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
