Constrained edge dynamic deleting in CD-TIN based on influence domain retriangulation of virtual point

Yanbing Wang, Lixin Wu, Wen Zhong Shi

Research output: Journal article publicationJournal articleAcademic researchpeer-review


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.
Original languageEnglish
Pages (from-to)208-212
Number of pages5
JournalGeo-Spatial Information Science
Issue number3
Publication statusPublished - 5 Sep 2007


  • CD-TIN
  • Constrained edge deletion
  • Data updating
  • Influence domain retriangulation
  • Virtual point

ASJC Scopus subject areas

  • Geography, Planning and Development
  • Computers in Earth Sciences

Cite this