By Topic

A factored approach to subdivision surfaces

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)
Warren, Joe ; Rice Univ., Houston, TX, USA ; Schaefer, Scott

Polygons are a ubiquitous modeling primitive in computer graphics. However, modeling with polygons is problematic for highly faceted approximations to smooth surfaces. The sheer size of these approximations makes them impossible to manipulate directly. Subdivision solves this problem by representing a smooth shape in terms of a coarse polygonal model. The subdivision rules used during this refinement process depend only on the initial model's topological connectivity and yield surfaces with guaranteed smoothness. Subdivision schemes are either interpolating or approximating. The averaging methods we've described are approximating in that the surfaces don't interpolate the original surface's vertices. Interpolating methods interpolate the vertices of the original surface, giving the user a more intuitive feel of the final surface shape.

Published in:

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