Efficient Calculation of Subdivision Surfaces for Visualization
Markus Kohler and
Heinrich Müller
Additional contact information
Markus Kohler: University of Dortmund, Department for Graphical Systems
Heinrich Müller: University of Dortmund, Department for Graphical Systems
A chapter in Visualization and Mathematics, 1997, pp 165-179 from Springer
Abstract:
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.
Keywords: Fine Mesh; Efficient Calculation; Subdivision Scheme; Edge Node; Quadrilateral Mesh (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-59195-2_11
Ordering information: This item can be ordered from
http://www.springer.com/9783642591952
DOI: 10.1007/978-3-642-59195-2_11
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().