首页> 外文会议> >A Modified Constrained Delaunay Triangulation Algorithm Based on Extracted Boundary Characteristic Points
【24h】

A Modified Constrained Delaunay Triangulation Algorithm Based on Extracted Boundary Characteristic Points

机译:基于提取的边界特征点的改进约束Delaunay三角剖分算法

获取原文

摘要

TIN is used widely in terrain expression and Delaunay Triangulation algorithm is the most popular one in reality. The problem that Delaunay Triangulation in the constrained data field is dissatisfied for DT-characteristics is discussed and three exiting algorithms for extra points are analyzed. Algorithms is aiming to reduce the number of extra points from the geometrical view and consequently constructing the real terrain, so an algorithm for constrained Delaunay triangulation based on extracted boundary characteristic points is proposed. The essential of this algorithm is extracting all characteristic points which can construct real terrain and omitting extra points, then constructing Delaunay Triangulation network to ensure its third dimension.
机译:TIN被广泛用于地形表达中,而Delaunay三角剖分算法是现实中最受欢迎的算法。讨论了DT数据特性不满足约束数据域中的Delaunay三角剖分的问题,并分析了三种现有的加分算法。该算法的目的是减少几何视图上多余点的数量,从而构造出真实的地形,因此提出了一种基于提取的边界特征点的约束Delaunay三角剖分算法。该算法的本质是提取所有可以构造真实地形的特征点并省略多余的点,然后构造Delaunay三角网以确保其第三维。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号