Topological obstructions to blending algorithms Original Research Article

Any practical curve-blending algorithm should produce blending curves without singularities or self-intersections. In addition, in a parametric modeling environment, the blending curve (and its tangent directions) should depend continuously on the boundary conditions. We prove that, in any dimension, no algorithm having all these properties exists. Any curve-blending algorithm will either exhibit discontinuous dependence on the boundary conditions or produce curves with singularities and self-intersections for a wide range of boundary conditions. Furthermore, we show that these unavoidable singularities must be severe (as measured against any practical criteria).