A butterfly subdivision scheme for surface interpolation with tension control
ACM Transactions on Graphics (TOG)
Surface interpolation on irregular networks with normal conditions
Computer Aided Geometric Design
Efficient, fair interpolation using Catmull-Clark surfaces
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Interpolating Subdivision for meshes with arbitrary topology
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Proceedings of the conference on Visualization '01
Interpolation over Arbitrary Topology Meshes Using a Two-Phase Subdivision Scheme
IEEE Transactions on Visualization and Computer Graphics
Similarity based interpolation using Catmull–Clark subdivision surfaces
The Visual Computer: International Journal of Computer Graphics
Progressive iterative approximation and bases with the fastest convergence rates
Computer Aided Geometric Design
Totally positive bases and progressive iteration approximation
Computers & Mathematics with Applications
Local progressive-iterative approximation format for blending curves and patches
Computer Aided Geometric Design
The convergence of the geometric interpolation algorithm
Computer-Aided Design
Technical Section: An extended iterative format for the progressive-iteration approximation
Computers and Graphics
Adaptive data fitting by the progressive-iterative approximation
Computer Aided Geometric Design
Computer Graphics in China: Convergence analysis for B-spline geometric interpolation
Computers and Graphics
Hi-index | 0.00 |
A new method for constructing interpolating Loop subdivision surfaces is presented. The new method is an extension of the progressive interpolation technique for B-splines. Given a triangular mesh M, the idea is to iteratively upgrade the vertices of M to generate a new control mesh M such that limit surface of M interpolates M. It can be shown that the iterative process is convergent for Loop subdivision surfaces. Hence, the method is well-defined. The new method has the advantages of both a local method and a global method, i.e., it can handle meshes of any size and any topology while generating smooth interpolating subdivision surfaces that faithfully resemble the shape of the given meshes.