Curvature of approximating curve subdivision schemes

  • Authors:
  • KĘstutis Karčiauskas;Jörg Peters

  • Affiliations:
  • Vilnius University, Lithuania;University of Florida

  • Venue:
  • Proceedings of the 7th international conference on Curves and Surfaces
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The promise of modeling by subdivision is to have simple rules that avoid cumbersome stitching-together of pieces. However, already in one variable, exactly reproducing a variety of basic shapes, such as conics and spirals, leads to non-stationary rules that are no longer as simple; and combining these pieces within the same curve by one set of rules is challenging. Moreover, basis functions, that allow reading off smoothness and computing curvature, are typically not available. Mimicking subdivision of splines with non-uniform knots allows us to combine the basic shapes. And to analyze non-uniform subdivision in general, the literature proposes interpolating the sequence of subdivision control points by circles. This defines a notion of discrete curvature for interpolatory subdivision. However, we show that this discrete curvature generically yields misleading information for non-interpolatory subdivision and typically does not converge, not even for non-uniform spline subdivision. Analyzing the causes yields three general approaches for solving or at least mitigating the problem: equalizing parameterizations, sampling subsequences and a new skip-interpolating subdivision approach.