A unified approach to subdivision algorithms near extraordinary vertices. (English) Zbl 0872.65007

Summary: We present a unified approach to subdivision algorithms for meshes with arbitrary topology which admits a rigorous analysis of the generated surface and give a sufficient condition for the regularity of the surface, i.e. for the existence of a regular smooth parametrization near the extraordinary point. The criterion is easily applicable to all known algorithms such as those of Doo-Sabin and Catmull-Clark, but will also be useful to construct new algorithms like interpolatory subdivision schemes.


65D17 Computer-aided design (modeling of curves and surfaces)
68U07 Computer science aspects of computer-aided design
Full Text: DOI


[1] Ball, A. A.; Storry, D. J.T., A matrix approach to the analysis of recursively generated B-spline surfaces, Computer-Aided Design, 18, 437-442 (1986)
[2] Ball, A. A.; Storry, D. J.T., Conditions for tangent plane continuity over recursively generated B-spline surfaces, ACM Trans. Graph., 7, 2, 83-102 (1988) · Zbl 0663.65012
[3] Catmull, E.; Clark, J., Recursively generated B-spline surfaces on arbitrary topological meshes, Computer-Aided Design, 10, 350-355 (1978)
[4] Doo, D.; Sabin, M. A., Behaviour of recursive division surfaces near extraordinary points, Computer-Aided Design, 10, 356-360 (1978)
[5] Loop, Ch. T., Smooth Subdivision for Surfaces Based on Triangles, (Master Thesis (1987), Univ. of Utah,: Univ. of Utah, Salt Lake City)
[6] Nasri, A. H., Polyhedral subdivision methods for free-form surfaces, ACM Trans. Graph., 6, 1, 29-73 (1987) · Zbl 0637.65144
[7] Reif, U., Neue Aspekte in der Theorie der Freiformflächen beliebiger Topologie, (Thesis (1993), Universität Stuttgart) · Zbl 0850.65021
[8] Halstead, M.; Kass, M.; DeRose, T. D., Efficient, Fair interpolation using Catmull-Clark surfaces, (SIGGRAPH ’93 (1993), ACM Press,: ACM Press, New York), 35-44
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.