| 任意多边形内带特征约束的散列数据的最优三角剖分 |
| |
| 引用本文： | 卢朝阳,吴成柯.任意多边形内带特征约束的散列数据的最优三角剖分[J].计算机辅助设计与图形学学报,1997,9(4):302-308. |
| |
| 作者姓名： | 卢朝阳 吴成柯 |
| |
| 作者单位： | 西安电子科技大学通信工程学院 |
| |
| 基金项目： | 国家自然科学基金,电科院预研基金 |
| |
| 摘 要： | 给出了一种新的基于Ｄｅｌａｕｎａｙ三角形化的任意多边形边界内散列数据的优化三角剖分算法，该算法可允许散列数据任意复杂的折线及封闭多边形环的特征约束。算法用统一的数据结构来记录散列数据、约束特征和三角剖分信息，并且引入了辅助窗的概念，从而使优化剖分和加入约束容易实现。
|
| 关 键 词： | 优化 三角剖分 Delaunay三角形 特征约束 |
OPTIMAL TRIANGULATION OF DATA POINTS SCATTERED IN ARBITRARY POLYGON WITH CHARACTERISTIC CONSTRAINTS |
| |
| Lu Zhaoyang and Wu Chengke.OPTIMAL TRIANGULATION OF DATA POINTS SCATTERED IN ARBITRARY POLYGON WITH CHARACTERISTIC CONSTRAINTS[J].Journal of Computer-Aided Design & Computer Graphics,1997,9(4):302-308. |
| |
| Authors: | Lu Zhaoyang and Wu Chengke |
| |
| Abstract: | This paper presents an algorithm based on the Delaunay strategy for optimal triangulation of data points scattered in 2D region with polygonal boundary. The characteristic constraints of the data, which could be polylines and/or polygons with any complicated contour, can be imposed on the triangulation. A generic data structure is used to store the scattered data, their constraints and triangulation information. Besides, an auxiliary window is introduced to facilitate the construction and programming. |
| |
| Keywords: | scattered data optimal triangulation Delaunay triangulation characteristic constraint |
| 本文献已被 CNKI 维普 等数据库收录！ |
