摘要
首先给出关于平面上散乱数据点的最优凸三角分划的定义。然后,讨论了最优凸三角分划的理论与实现。最后,介绍一个新的最优三角分划算法,并且证明由该算法所得到的三角分划的最优性。
In this paper, we first give foe definition or the optimal convex triangulation of the scattered data points in aplane, then discuss the theory and realixation of the triangulation. Finally, we introduce a new algorithm for triangulating, and prove thee optimation of the triangulation gotten by the algorithm which was put forward by literature.
出处
《五邑大学学报(自然科学版)》
CAS
1994年第3期60-66,共7页
Journal of Wuyi University(Natural Science Edition)
关键词
散乱数据
三角分划
算法
插值
曲面拟合
Scattered Data
Triangulation
Algorithm
Intorpolation
Surface Fitting