Superfaces: polyhedral approximation with bounded error

Alan David Kalvin; Russell H. Taylor

doi:10.1117/12.173991

1 May 1994 Superfaces: polyhedral approximation with bounded error

Alan David Kalvin, Russell H. Taylor

Proceedings Volume 2164, Medical Imaging 1994: Image Capture, Formatting, and Display; (1994) https://doi.org/10.1117/12.173991
Event: Medical Imaging 1994, 1994, Newport Beach, CA, United States

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.

Citation Download Citation

Alan David Kalvin and Russell H. Taylor "Superfaces: polyhedral approximation with bounded error", Proc. SPIE 2164, Medical Imaging 1994: Image Capture, Formatting, and Display, (1 May 1994); https://doi.org/10.1117/12.173991

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available