首页> 外文OA文献 >Integral ear elimination and virtual point-based updating algorithms for constrained Delaunay TIN
【2h】

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

机译:约束Delaunay TIN的整体耳朵消除和基于虚拟点的更新算法

摘要

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.
机译:约束Delaunay三角不规则网络(CD-TIN)是一种特殊的数据结构,在地理信息学中具有许多实际应用,尤其是在DTM和DSM的线性约束三角剖分表示中,例如在数字城市和数字矿山中。以往关于D-TIN的研究主要集中在不考虑约束的点插入和删除上,而关于CD-TIN的研究通常更关注点和边的插入算法,而很少关注删除算法。所提出的算法远远不足以动态更新CD-TIN。在本文中,CD-TIN中的约束边被认为是任何一组虚线,即多边形边,虚线和简单线段。约束边可以由一个或多个约束段组成,并且可以采用任何形式:打开或关闭,相交或自相交。通过改进现有的D-TIN插入和删除算法,提出了两种新的CD-TIN更新算法。根据CD-TIN中约束的多态性,当在CD-TIN中插入约束边时,采用虚拟点表示约束边之间的交叉节点。提出了两种新算法,即积分耳消除(IEE)和虚拟点影响域重新三角化(IDRVP),前者用于约束点删除,而后者用于约束边的插入和删除。 IDRVP的原理是通过约束保持边将虚拟点的影响域划分为某些部分,并参考约束的可见性和约束空圆(CEC)准则分别对影响域的每个部分进行重新三角化。最后,使用VC ++开发了一个原型系统,并以3D地形和建筑物的集成为例,测试了新算法的正确性。结果表明,新算法对CD-TIN的更新有效。

著录项

  • 作者

    Wu L; Wang Y; Shi W;

  • 作者单位
  • 年度 2008
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号