Issue No. 02 - March/April (1989 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.19053
<p>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.</p>
L. De Floriani, "A Pyramidal Data Structure for Triangle-Based Surface Description," in IEEE Computer Graphics and Applications, vol. 9, no. , pp. 67-78, 1989.