| 散乱数据点三角剖分方法综述 |
| |
| 引用本文： | 周晓云,朱心雄.散乱数据点三角剖分方法综述[J].工程图学学报,1993(1):48-54. |
| |
| 作者姓名： | 周晓云 朱心雄 |
| |
| 作者单位： | 北京航空航天大学
(周晓云)，北京航空航天大学(朱心雄) |
| |
| 摘 要： | 构造散乱数据插值曲面首先必须对散乱数据点实行三角剖分。本文简要阐述三角剖分的基本概念。并按优化准则将现有的各种三角剖分方法进行分类比较,为建立更好的凸域三角剖分算法提供依据,并为解决复杂多边形区域散乱数据点三角剖分奠定基础。
|
| 关 键 词： | 散乱数据点 三角剖分 插值 |
A SURVEY OF TRIANGULATION METHODS FOR SEATTERED DATA POINTS |
| |
| Zhou Xiaoyun,Zhu Xinxiong Beijing University of Aeronautics and Astronautics.A SURVEY OF TRIANGULATION METHODS FOR SEATTERED DATA POINTS[J].Journal of Engineering Graphics,1993(1):48-54. |
| |
| Authors: | Zhou Xiaoyun Zhu Xinxiong Beijing University of Aeronautics and Astronautics |
| |
| Affiliation: | Zhou Xiaoyun;Zhu Xinxiong Beijing University of Aeronautics and Astronautics |
| |
| Abstract: | Triangular interpolants are widely used to construct smooth surfaces from scattered data
in 3D.To apply smooth triangular interpolants,the input 3D points have to be triangulated
first.Based on the elementary knowledge about triangulation,existing triangulation
methods for 2D scattered data points in convex region are briefly described,analyzed and
compared according to different optimization criteria.This can help to propose a new trian-
gulation algorithm and lay a foundation for triangulation in non-convex region. |
| |
| Keywords: | scattered data point Delaunay triangulation Voronoi graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
