| Constrained Edge Dynamic Deleting in CD-TIN Based on Influence Domain Retriangulation of Virtual Point |
| |
| 作者姓名： | WANG Yanbing WU Lixin SHI Wenzhong |
| |
| 作者单位： | Institute of 3D Information Acquisition and Application Capital Normal University，105 North Xisanhuan Road Beijing 100037 China |
| |
| 摘 要： | Constrained Delaunay triangulated irregular network is one kind of dynamic data structures used in geosciences. The research on point and edges insertion in CD-TIN is the basis of its application. Comparing with the algorithms of points and constrained edge insertion, there are very a few researches on constrained edge deletion in CD-TIN. Based on the analysis of the polymorphism of constrained edge, virtual points are used to describe the intersection of constrained edges. A new algorithm is presented, called as influence domain retriangulating for virtual point (IDRVP), to delete constrained edges with virtual points. The algorithm is complete in topology. Finally, the algorithm is tested by some applications cases.
|
| 关 键 词： | GIS 地理信息系统 数据处理 虚拟点 |
| 文章编号： | 1009-5020（2007）03-208-05 |
| 收稿时间： | 4 June 2007 |
| 修稿时间： | 2007-06-04 |
Constrained edge dynamic deleting in CD-TIN based on influence domain retriangulation of virtual point |
| |
| WANG Yanbing WU Lixin SHI Wenzhong.Constrained Edge Dynamic Deleting in CD-TIN Based on Influence Domain Retriangulation of Virtual Point[J].Geo-Spatial Information Science,2007,10(3):208-212. |
| |
| Authors: | Wang Yanbing Wu Lixin Shi Wenzhong |
| |
| Institution: | (1) Institute of 3D Information Acquisition and Application, Capital Normal University, 105 North Xisanhuan Road, Beijing, 100037, China |
| |
| Abstract: | Constrained Delaunay triangulated irregular network is one kind of dynamic data structures used in geosciences. The research on point and edges insertion in CD-TIN is the basis of its application. Comparing with the algorithms of points and constrained edge insertion, there are very a few researches on constrained edge deletion in CD-TIN. Based on the analysis of the polymorphism of constrained edge, virtual points are used to describe the intersection of constrained edges. A new algorithm is presented, called as influence domain retriangulating for virtual point (IDRVP), to delete constrained edges with virtual points. The algorithm is complete in topology. Finally, the algorithm is tested by some applications cases. |
| |
| Keywords: | CD-TIN data updating constrained edge deletion virtual point influence domain retriangulation |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
