摘要
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.
抑制 Delaunay triangulated 不规则的网络是在地球科学使用的一个种动态数据结构。关于在 CD 听的点和边插入的研究是它的申请的基础。与点和抑制的边插入的算法作比较，有很关于在 CD 听的抑制的边删除的一些研究。基于抑制的边的多型性的分析，虚拟点被用来描述抑制的边的交叉。一个新算法被介绍，作为影响领域 retriangulating 要求了虚拟点(IDRVP ) ，与虚拟点抑制了边删除。算法在拓扑学是完全的。最后，算法被一些应用盒子测试。
