In this paper we present a local fitting algorithm for converting smooth planar curves to Bsplines. For a smooth planar curve a set of points together with their tangent vectors a...
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
In some applications objects are known to have nonsmooth or “jagged” edges, which are not well approximated by smooth curves. We use subdivision curves as a simple but flexib...
Arc splines are G1 continuous curves made of circular arcs and straight-line segments. They have the advantages that the curvature of an arc spline is known and controlled at all ...
A key problem when interpolating a network of curves occurs at vertices: an algebraic condition called the vertex enclosure constraint must hold wherever an even number of curves ...