A pyramidal data structure for triangle-based surface description

Author

De Floriani, Leila De

Author_Institution

Inst. of Appl. Math., Nat. Res. Council, Genova, Italy

Volume

9

Issue

2

fYear

1989

fDate

3/1/1989 12:00:00 AM

Firstpage

67

Lastpage

78

Abstract

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.<>

Keywords

computational complexity; computer graphics; data compression; data structures; encoding; Delaunay pyramid; Delaunay triangulations; computer graphics; data compression; encoding; hierarchical model; point location; pyramidal data structure; spatial data; storage complexity; triangle-based surface description; Application software; Computer graphics; Computer vision; Data processing; Data structures; Encoding; Face detection; Mathematical model; Shape; Surface reconstruction;

fLanguage

English

Journal_Title

Computer Graphics and Applications, IEEE

Publisher

ieee

ISSN

0272-1716

Type

jour

DOI

10.1109/38.19053

Filename

19053