| 注册
首页|期刊导航|计算机工程与应用|面向多边形三维显示的快速三角化方法研究

面向多边形三维显示的快速三角化方法研究

朱庆伟 李云飞

计算机工程与应用Issue(5):147-150,4.
计算机工程与应用Issue(5):147-150,4.DOI:10.3778/j.issn.1002-8331.1307-0229

面向多边形三维显示的快速三角化方法研究

Research on 3D display of fast triangular polygon

朱庆伟 1李云飞1

作者信息

  • 1. 西安科技大学 测绘科学与技术学院,西安 710054
  • 折叠

摘要

Abstract

In order to satisfy the actual demand of surface and underground mining area construction of curved surface, especially in the pit, according to the classical problem is widely used in graphics computational geometry polygon trian-gulation, it presents a visual point using the maximum angle as triangular mesh triangle extension point construction algo-rithm, constraint conditions of the algorithm is the area of the triangle, and polygon triangulation by recursion. Combined with the example of contrast, boundary points processing the algorithm in both precision and accuracy are both good per-formances. The algorithm is simple to realize, easy to understand, after repeated modification and improvement, has become one of the digital mine 3D software Vrmine core algorithms.

关键词

多边形/三角形化/可用点/面积/数字矿山

Key words

polygon/triangularization/useable vertex/area/digital mine

分类

信息技术与安全科学

引用本文复制引用

朱庆伟,李云飞..面向多边形三维显示的快速三角化方法研究[J].计算机工程与应用,2014,(5):147-150,4.

基金项目

国家自然科学基金(No.41272388);陕西省教育厅科研项目资助项目(No.12JK0781)。 ()

计算机工程与应用

OA北大核心CSCDCSTPCD

1002-8331

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