Share Email Print
cover

Proceedings Paper

Superfaces: polyhedral approximation with bounded error
Author(s): Alan David Kalvin; Russell H. Taylor
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We describe superfaces, a new method for simplifying closed polyhedra. The superfaces algorithm performs the simplification based on a bounded approximation criterion that produces a simplified polyhedron that approximates the original one to within a prespecified tolerance. The vertices in the simplified polyhedron are a proper subset of the original vertices, so the algorithm is well-suited for creating hierarchical representations of polyhedra.

Paper Details

Date Published: 1 May 1994
PDF: 12 pages
Proc. SPIE 2164, Medical Imaging 1994: Image Capture, Formatting, and Display, (1 May 1994); doi: 10.1117/12.173991
Show Author Affiliations
Alan David Kalvin, IBM Thomas J. Watson Research Ctr. (United States)
Russell H. Taylor, IBM Thomas J. Watson Research Ctr. (United States)


Published in SPIE Proceedings Vol. 2164:
Medical Imaging 1994: Image Capture, Formatting, and Display
Yongmin Kim, Editor(s)

© SPIE. Terms of Use
Back to Top