Please use this identifier to cite or link to this item:
Title: Point deletion for dynamic update of CD-TIN
Authors: Wu, L
Wang, Y
Shi, W 
Jia, X
Keywords: CD-TIN
Constrained vertex
Data updating
Integral ear elimination algorithm (IEE)
Issue Date: 2005
Source: International Geoscience and Remote Sensing Symposium (IGARSS), 2005, v. 2, 1525248, p. 870-873 How to cite?
Abstract: 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.
Description: 2005 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2005, Seoul, 25-29 July 2005
ISBN: 0780390504
DOI: 10.1109/IGARSS.2005.1525248
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 21, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 17, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.