Abstract
The algorithm described here obtains a polygonal approximation of the object silhouette which is then decomposed into convex components. For each convex component, a pyramid is formed with the view point as its apex and the convex components as a cross section. An octree representation of each of these pyramids is obtained by undertaking intersection detection of the object with the cubes corresponding to octree nodes. A performance index to the algorithm is the ratio of the actual volume of the object to the volume of the object reconstructed from the octree representation. -after Authors
Original language | English (US) |
---|---|
Pages (from-to) | 68-84 |
Number of pages | 17 |
Journal | Computer Vision, Graphics, & Image Processing |
Volume | 49 |
Issue number | 1 |
DOIs | |
State | Published - 1990 |
ASJC Scopus subject areas
- Environmental Science(all)
- Engineering(all)
- Earth and Planetary Sciences(all)