By Topic

Superfaces: polygonal mesh simplification with bounded error

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. D. Kalvin ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; R. H. Taylor

The algorithm presented simplifies polyhedral meshes within prespecified tolerances based on a bounded approximation criterion. The vertices in the simplified mesh are a proper subset of the original vertices. The algorithm, called Superfaces, makes two major contributions to the research in this area: it uses a bounded approximation approach, which guarantees that a simplified mesh approximates the original mesh to within a prespecified tolerance (that is, every vertex v in the original mesh will lie within a user specified distance ε of the simplified mesh); its face merging procedure is efficient and greedy-that is, it does not backtrack or undo any merging once completed and thus, the algorithm is practical for simplifying very large meshes

Published in:

IEEE Computer Graphics and Applications  (Volume:16 ,  Issue: 3 )