| 注册
首页|期刊导航|计算机工程与应用|改进的平面域Delaunay三角网生成算法

改进的平面域Delaunay三角网生成算法

邹永贵 张涛

计算机工程与应用Issue(20):171-174,4.
计算机工程与应用Issue(20):171-174,4.DOI:10.3778/j.issn.1002-8331.1201-0091

改进的平面域Delaunay三角网生成算法

Improved generation algorithm of Delaunay triangulation on plane domain

邹永贵 1张涛1

作者信息

  • 1. 重庆邮电大学 中韩合作GIS研究所,重庆 400065
  • 折叠

摘要

Abstract

This paper presents the research status of Delaunay triangulation algorithm and uses mesh generation to improve the speed of network construction. The paper makes the full use of topological relation between point and triangle, and reduces the times of the calculation of barycenter based on point-edge direction locating thesis to increase the efficiency of the location of tri-angle and accelerate the speed of network construction. The experimental results prove that the algorithm is of high efficiency and stability.

关键词

不规则三角网/逐点插入法/三角形定位

Key words

Triangular Irregular Network(TIN)/point insertion/triangle location

分类

信息技术与安全科学

引用本文复制引用

邹永贵,张涛..改进的平面域Delaunay三角网生成算法[J].计算机工程与应用,2013,(20):171-174,4.

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文