Please use this identifier to cite or link to this item:
Title: Constrained edge dynamic deleting in CD-TIN based on influence domain retriangulation of virtual point
Authors: Wang, Y
Wu, L
Shi, W 
Keywords: CD-TIN
Data updating
Constrained edge deletion
Virtual point
Influence domain retriangulation
Issue Date: 2007
Publisher: Taylor & Francis Asia Pacific (Singapore)
Source: Geo-spatial information science (地球空间信息科学学报), Sept. 2007, v. 10, no. 3, p. 208-212 How to cite?
Journal: Geo-spatial information science (地球空间信息科学学报) 
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.
ISSN: 1009-5020
EISSN: 1993-5153
DOI: 10.1007/s11806-007-0065-5
Rights: © 2007 中国学术期刊电子杂志出版社。本内容的使用仅限于教育、科研之目的。
© 2007 China Academic Journal Electronic Publishing House. It is to be used strictly for educational and research use.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Wang_Constrained_Edge_Dynamic.pdf435.92 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Contents

Page view(s)

Last Week
Last month
Citations as of Aug 21, 2018


Citations as of Aug 21, 2018

Google ScholarTM



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