Efficient, fair interpolation using Catmull-Clark surfaces
Mark Halstead, Michael Kass, Tony DeRose · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · 1993
We describe an efficient method for constructing a smooth surface that interpolates the vertices of a mesh of arbitrary topological type. Normal vectors can also be interpolated at an arbitrary subset of the vertices. The method improves on existing interpolation techniques in that it is fast, robust and general. Our approach is to compute a control mesh whose Catmull-Clark subdivision surface interpolates the given data and minimizes a smoothness or "fairness" measure of the surface. Following Celniker and Gossard, the norm we use is based on a linear combination of thin-plate and membrane energies. Even though Catmull-Clark surfaces do not possess closed-form parametrizations, we show that the relevant properties of the surfaces can be computed efficiently and without approximation. In particular, we show that (1) simple, exact interpolation conditions can be derived, and (2) the fairness norm and its derivatives can be computed exactly, without resort to numerical integration.
Cited by 393 works. doi:10.1145/166117.166121
Authors
References
- Matrix Computations
- Recursively generated B-spline surfaces on arbitrary topological meshes
- Behaviour of recursive division surfaces near extraordinary points
- Smooth Subdivision Surfaces Based on Triangles
- An algorithm for high-speed curve generation
- Deformable curve and surface finite-elements for free-form shape design
- Functional optimization for fair surface design
- Polyhedral subdivision methods for free-form surfaces
- Local surface interpolation with Bézier patches
- Conditions for tangent plane continuity over recursively generated B-spline surfaces