Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
From MaRDI portal
Publication:1605743
DOI10.1016/S0167-8396(99)00026-6zbMath0997.65016MaRDI QIDQ1605743
David Lutterkort, Jörg Peters, D. Nairn
Publication date: 23 July 2002
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
subdivision; quadratic convergence; Hausdorff distance; adaptive refinement; control point; control polygons; Bézier control polygon; Bézier segment
65D17: Computer-aided design (modeling of curves and surfaces)
Related Items
Mean Distance from a Curve to Its Control Polygon, Optimized refinable enclosures of multivariate polynomial pieces, On the deviation of a parametric cubic spline interpolant from its data polygon, A bound on the approximation of a Catmull-Clark subdivision surface by its limit mesh, Preserving computational topology by subdivision of quadratic and cubic Bézier curves, Dynamic Bezier curves for variable rate-distortion, Estimating error bounds for quaternary subdivision schemes, An effective bound on the gap between the control polytype and the graph of a real polynomial on a simplex, The distance of a subdivision surface to its control polyhedron, Least squares methods for solving differential equations using Bézier control points., Sleves for planar spline curves, Quasi-Bezier curves integrating localised information, Error bounds for a convexity-preserving interpolation and its limit function, Estimating error bounds for binary subdivision curves/surfaces, Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon, Estimating error bounds for tensor product binary subdivision volumetric model
