Bounding the Hausdorff distance between implicitly defined and/or parametric curves

This paper is devoted to computational techniques for generating upper bounds on the Hausdorff distance between two planar curves. The results are suitable for pairs of implicitly defined and/or parametric curves. The bounds are computed directly from the control points resp. spline coefficients of the curves. They improve an earlier result of Sederberg. Potential applications include error bounds for the approximate implicitization of spline curves, for the approximate parameterization of (piecewise) algebraic curves, and for algebraic curve fitting.