On the Complexity of Smooth Spline Surfaces from Quad Meshes

Details On the Complexity of Smooth Spline Surfaces from Quad Meshes On the Complexity of Smooth Spline Surfaces from Quad Meshes

2009-06-05

arxiv.org/abs/0906.1226v1

Computer Science

Graphics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Smooth Spline Surfaces from Quad Meshes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of Smooth Spline Surfaces from Quad Meshes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Smooth Spline Surfaces from Quad Meshes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-61840