Summary
A subdivision surface is defined by a polygonal mesh which is iteratively refined into an infinite sequence of meshes converging to the desired smooth surface. Classical subdivision schemes are those described and analysed by Catmull—Clark and Doo—Sabin. A graphical representation can be obtained by stopping the iteration on a level of refinement sufficient to yield a smooth representation when drawing the mesh on that level. However, the storage requirements of the finest mesh and those on the previous levels can be considerable, that is exponential in the number of iterations, since the number of mesh elements grows by a constant factor from level to level. We overcome this problem by deviating from level-wise breadth-first subdivision by subdividing the mesh locally in a depth-first manner over all levels of iteration. This results in a front of subdivision which moves over the surface and successively reports the elements of the finest mesh. Only the front of subdivision must be held in main memory, and it needs only about square-root of the space required by the standard method, at about the same time of computation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Catmull and J. Clark, Recursively generated b-spline surfaces on arbitrary topological meshes, Computer Aided Design, Vol. X (6), November (1978), 350–355.
D. Doo and M. Sabin, Behaviour of recursive division surfaces near extraordinary points, Computer Aided Design, Vol. X, November (1978), 356–360.
N. Dyn, D. Levin, and C. A. Micchelli, Using parameters to increase smoothness of curves and surfaces generated by subdivision, (1990).
J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes, Computer Graphics, Addison-Wesley Publishing Company, Bonn, 2nd edition (1992).
M. Halstead, M. Kass, and T. DeRose, Efficient, fair interpolation using catmull-clark surfaces, ACM Computer Graphics Proceedings, August (1993).
A. H. Nasri, Polyhedral subdivision methods for free-form surfaces, ACM Transactions on Graphics, Vol. VI (1), January (1987), 29–73.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kohler, M., Müller, H. (1997). Efficient Calculation of Subdivision Surfaces for Visualization. In: Hege, HC., Polthier, K. (eds) Visualization and Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59195-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-59195-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63891-6
Online ISBN: 978-3-642-59195-2
eBook Packages: Springer Book Archive