Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22647
Title: Integral ear elimination and virtual point-based updating algorithms for constrained Delaunay TIN
Authors: Wu, L
Wang, Y
Shi, W 
Keywords: Data updating
Delaunay TIN
Digital mine
Polymorphism
Spatial constraint
Spatial modeling
Issue Date: 2008
Publisher: Science in China Press
Source: Science in China. Series E, Technological sciences, 2008, v. 51, no. SUPPL. 1, p. 135-144 How to cite?
Journal: Science in China. Series E, Technological sciences 
Abstract: Constrained Delaunay Triangular Irregular Networks (CD-TIN), a kind of special data structure, have many practical applications in Geoinformatics, especially in the representation of linear constrained triangulation for DTM and DSM, such as in digital city and digital mine. Past researches on D-TIN mainly focused on point insertion and deletion without consideration of constraint, and that on CD-TIN usually paid more attention to the insertion algorithms for points and edges, but little to the deletion algorithms. The presented algorithms are far insufficient for the dynamic updating of CD-TIN. In this paper, the constraint edge in CD-TIN is considered to be any set of broken lines, i.e., polygon edges, broken lines and simple segments. The constraint edge may be composed of one or more constraint segments, and it is allowed to be in any form: Open or close, intersection or self-intersection. By improving to present insertion and deletion algorithms for D-TIN, two new algorithms for CD-TIN updating are presented. According to the polymorphism of the constraints in CD-TIN, virtual point is adopted to represent the crossing node between constraint edges when a constraint edge is inserted in CD-TIN. Two new algorithms named as Integral Ear Elimination (IEE) and Influence Domain Retriangulation for Virtual Point (IDRVP) are presented, the former is for constraint point deletion, while the later is for the insertion and deletion of constraint edge. The principle of IDRVP is that to divide the influence domain of a virtual point into some parts by the constraint-keeping edges, and to retriangulate each part of the influence domain individually referring to the constraint visible property and constraint empty circle (CEC) criterion. Finally, a prototype system is developed with VC++, one case on the integration of 3D terrain and buildings is demonstrated to test the correctness of new algorithms. It shows that the new algorithms are effective for the updating of CD-TIN.
URI: http://hdl.handle.net/10397/22647
ISSN: 1006-9321
DOI: 10.1007/s11431-008-5018-1
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Aug 22, 2017

Page view(s)

37
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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