On the complexity of smooth spline surfaces from quad meshes

From MaRDI portal
Publication:631006

DOI10.1016/J.CAGD.2009.09.003zbMATH Open1210.65046arXiv0906.1226OpenAlexW2963378552MaRDI QIDQ631006FDOQ631006


Authors: Jianhua Fan, Jörg Peters Edit this on Wikidata


Publication date: 22 March 2011

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Abstract: 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-conneced 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.


Full work available at URL: https://arxiv.org/abs/0906.1226




Recommendations




Cites Work


Cited In (13)





This page was built for publication: On the complexity of smooth spline surfaces from quad meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631006)