Bicubic patches for approximating non-rectangular control-point meshes
Computer Aided Geometric Design
Filling polygonal holes with bicubic patches
Computer Aided Geometric Design
Degenerate polynomial patches of degree 4 and 5 used for geometrically smooth interpolation in R3
Computer Aided Geometric Design
A characterization of connecting maps as nonlinear roots of the identity
Proceedings of the international conference on Curves and surfaces in geometric design
SIAM Journal on Numerical Analysis
Computer Aided Geometric Design
Computer Aided Geometric Design
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Approximating Catmull-Clark subdivision surfaces with bicubic patches
ACM Transactions on Graphics (TOG)
Extending Catmull-Clark Subdivision and PCCM with Polar Structures
PG '07 Proceedings of the 15th Pacific Conference on Computer Graphics and Applications
GPU conversion of quad meshes to smooth surfaces
Proceedings of the 2008 ACM symposium on Solid and physical modeling
ACM SIGGRAPH 2009 papers
A geometric criterion for smooth interpolation of curve networks
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Reconstruction of convergent G1 smooth B-spline surfaces
Computer Aided Geometric Design
Bicubic G1 interpolation of irregular quad meshes using a 4-split
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
Smooth Bi-3 spline surfaces with fewest knots
Computer-Aided Design
| Hi-index | 0.00 |
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the choice of reparameterizations for geometric continuity. In particular, when one bicubic tensor-product B-spline patch is associated with each facet of a quadrilateral mesh with n-valent vertices and we do not want segments of the boundary curves forced to be linear, then the relations dictate the minimal number and multiplicity of knots: For general data, the tensor-product spline patches must have at least two internal double knots per edge to be able to model a G^1-connected complex of C^1 splines. This lower bound on the complexity of any construction is proven to be sharp by suitably interpreting an existing surface construction. That is, we have a tight bound on the complexity of smoothing quad meshes with bicubic tensor-product B-spline patches.