Integral ear elimination and virtual point-based updating algorithms for constrained Delaunay TIN

被引:1
作者
WU LiXin1
2 Institute for GIS/RS/GPS & Subsidence Engineering Research
3 Laboratory of 3D Information Acquisition & Application
4 Center for Advanced GIS Research
机构
基金
中国国家自然科学基金;
关键词
Delaunay TIN; spatial constraint; data updating; spatial modeling; polymorphism; digital mine;
D O I
暂无
中图分类号
P208 [测绘数据库与信息系统];
学科分类号
070503 ; 081603 ; 0818 ; 081802 ;
摘要
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 in-sertion and deletion without consideration of constraint,and that on CD-TIN usu-ally 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 dy-namic updating of CD-TIN. In this paper,the constraint edge in CD-TIN is consid-ered 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 seg-ments,and it is allowed to be in any form: Open or close,intersection or self-in-tersection. 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 Retrian-gulation 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 influ-ence 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.
引用
收藏
页码:135 / 144
页数:10
相关论文
共 12 条
[1]   基于Hash函数的TIN拓扑关系重建 [J].
潘胜玲 ;
刘学军 ;
黄雄 ;
唐秀娟 .
地理与地理信息科学 , 2006, (02) :21-24+29
[2]   基于强约束Delaunay-TIN的三维地学模拟与可视化 [J].
郝海森 ;
吴立新 .
地理与地理信息科学, 2003, (02) :15-18
[3]  
3D integrated modeling approach to geo-engineering objects of hydraulic and hydroelectric projects[J] . DengHua Zhong,MingChao Li,Jie Liu.Science in China Series E: Technological Sciences . 2007 (3)
[4]   Regular triangulations of dynamic sets of points [J].
Vigo, M ;
Pla, N ;
Cotrina, J .
COMPUTER AIDED GEOMETRIC DESIGN, 2002, 19 (02) :127-149
[5]   Computing directional constrained Delaunay triangulations [J].
Vigo, M ;
Pla, N .
COMPUTERS & GRAPHICS-UK, 2000, 24 (02) :181-190
[6]   An improved incremental algorithm for constructing restricted Delaunay triangulations [J].
Anglada, MV .
COMPUTERS & GRAPHICS, 1997, 21 (02) :215-223
[7]  
Randomized incremental construction of Delaunay and Voronoi diagrams[J] . Leonidas J. Guibas,Donald E. Knuth,Micha Sharir.Algorithmica . 1992 (1)
[8]   CONSTRAINED DELAUNAY TRIANGULATIONS [J].
CHEW, LP .
ALGORITHMICA, 1989, 4 (01) :97-108
[9]  
A faster divide-and-conquer algorithm for constructing delaunay triangulations[J] . Rex A. Dwyer.Algorithmica . 1987 (1)
[10]  
A sweepline algorithm for Voronoi diagrams[J] . Steven Fortune.Algorithmica . 1987 (1)