Point deletion for Dynamic Update of CD-TIN

Lixin Wu, Yanbing Wang, Wen Zhong Shi, Xiaolin Jia

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)


Constrained Delaunay Triangular Irregular Network (CD-TIN) is a basic data structure widely used in GIS, 3D reconstruction, computer geometry and geosciences. Traditional researches on Delaunay Triangular Irregular Networks (D-TIN) paid more attention to the insertion algorithms for points and edges, while little to the deletion algorithms for points and edges. The present algorithms for D-TIN are far insufficient for the dynamic updating of CD-TIN, which demands for not only the insertion for points and edges, but also the deletion for points and constrained edges. Based on the improvements to the present insertion and deletion algorithms for D-TIN, an algorithm for point deletion in CD-TIN, namely Integral Ear Elimination (IEE), which improved from the EE algorithm for D-TIN, is presented. Some examples are demonstrated that the presented algorithms in this paper for the updating of CD-TIN are efficient.
Original languageEnglish
Title of host publication25th Anniversary IGARSS 2005
Subtitle of host publicationIEEE International Geoscience and Remote Sensing Symposium
Number of pages4
Publication statusPublished - 1 Dec 2005
Event2005 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2005 - Seoul, Korea, Republic of
Duration: 25 Jul 200529 Jul 2005


Conference2005 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2005
Country/TerritoryKorea, Republic of


  • CD-TIN
  • Constrained Vertex
  • Data Updating
  • Integral Ear Elimination Algorithm (IEE)

ASJC Scopus subject areas

  • Computer Science Applications
  • General Earth and Planetary Sciences


Dive into the research topics of 'Point deletion for Dynamic Update of CD-TIN'. Together they form a unique fingerprint.

Cite this