A pyramidal data structure for triangle-based surface description
A pyramidal data structure for triangle-based surface description
复制标题
DOI：
10.1109/38.19053
复制
发表时间：
1989-03
影响因子：
1.8
通讯作者：
L. Floriani
中科院分区：
文献类型：
--
作者：
L. Floriani
描述了一种用于逼近2-1/2维曲面的层次模型。这种模型称为Delaunay金字塔，是一种用于压缩空间数据并以连续更精细的细节级别表示表面的方法。Delaunay金字塔基于数据点集合的适当定义的子集的Delaunay三角剖分的序列。提出了一种面向三角形的Delaunay金字塔编码结构，并对其存储复杂度进行了分析。本文介绍了一种构造Delaunay金字塔的算法，并讨论了在这种模型上求解点的定位和评价的方法。>
A hierarchical model for approximating 2-1/2-dimensional surfaces is described. This model, called a Delaunay pyramid, is a method for compression of spatial data and representation of a surface at successively finer levels of detail. A Delaunay pyramid is based on a sequence of Delaunay triangulations of suitably defined subsets of the set of data points. A triangle-oriented encoding structure for a Delaunay pyramid is presented, and its storage complexity is evaluated. An algorithm for constructing a Delaunay pyramid is described, and a method for solving the point location and evaluation on such a model is discussed. >