| 基于虚点影响域重构的CD-TIN约束线删除算法 |
| |
| 引用本文： | 王彦兵, 吴立新, 史文中, 贾晓林. 基于虚点影响域重构的CD-TIN约束线删除算法[J]. 武汉大学学报 ( 信息科学版), 2005, 30(10): 862-865. |
| |
| 作者姓名： | 王彦兵 吴立新 史文中 贾晓林 |
| |
| 作者单位： | 1 中国矿业大学(北京校区;3S与沉陷工程研究所,北京市学院路丁11号,100083;2 东北大学3S与数字矿山研究中心,沈阳市和平区文化路3号,110004;3 香港理工大学土地测量与地理资讯学系,香港九龙红磡 |
| |
| 基金项目： | 北京市自然科学基金资助项目(4041005)，国家教育部“高校青年教师奖”专项基金资助项目，香港政府研究资助局资助项目(1.34.37.A222) |
| |
| 摘 要： | 根据CDTIN中约束线的多态性,提出了利用虚点描述约束线交叉的情况,并用虚点影响域重构算法(influence domain retriangulating for virtual point,IDRVP)来解决CDTIN约束线删除操作中的约束线交叉问题,确保了CDTIN的拓扑完备性,并对算法进行了验证。
|
| 关 键 词： | 约束Delaunay三角网 约束线 删除 影响域重构 |
| 文章编号： | 1671-8860(2005)10-0862-04 |
| 收稿时间： | 2005-07-29 |
| 修稿时间： | 2005-07-29 |
Constrained Edges Deletion in CD-TIN Based on Influence Domain Retriangulating for Virtual Point |
| |
| WANG Yanbing, WU Lixin, SHI Wenzhong, JIA Xiaolin. Constrained Edges Deletion in CD-TIN Based on Influence Domain Retriangulating for Virtual Point[J]. Geomatics and Information Science of Wuhan University, 2005, 30(10): 862-865. |
| |
| Authors: | WANG Yanbing WU Lixin SHI Wenzhong JIA Xiaolin |
| |
| Affiliation: | 1 Institute of RS/GPS/GIS and Subsidence Engineering, China University of Mining & Technology, D11 Xueyuan Road, Beijing 100083, China;2 Center of RS/GPS/GIS & Digital Mine Research, Northeastern University, 3 Wenhua Road, Heping District, Shenyang 110004, China;3 Department of Land Surveying and Geo-informatics, Hong Kong Polytechnic University, Kowloon, Hong Kong |
| |
| Abstract: | Based on the analysis of the polymorphism of constrained edges, this paper presentes that virtual points be used to describe the intersection of constrained edges, developes a new algorithm, called as influence domain retriangulating for virtual point (IDRVP), to delete constrained edges with virtual points. The algorithm is completed in topology, and the algorithm is tested by some applications cases. |
| |
| Keywords: | CD-TIN constrained edge deletion influence domain retriangulating |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息 |
|
点击此处可从《武汉大学学报(信息科学版)》下载全文 |
|
