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
Jörg Peters, D. Nairn, David Lutterkort
Publication date: 23 July 2002
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
subdivisionquadratic convergenceHausdorff distanceadaptive refinementcontrol pointcontrol polygonsBézier control polygonBézier segment
Related Items
Injectivity of NURBS curves, Computational topology: isotopic convergence to a stick knot, Isotopic equivalence by Bézier curve subdivision for application to high performance computing, Revisiting the problem of zeros of univariate scalar Béziers, Topological Integrity for Dynamic Spline Models During Visualization of Big Data, Sleves for planar spline curves, Computational topology for approximations of knots, Weighting Shepard-type operators, Preserving computational topology by subdivision of quadratic and cubic Bézier curves, Subdivision of Bézier curves for ambient isotopy in molecular modeling, A simple and efficient approximation of a Bézier piece by its cutdown polygon, Consolidated sharp bounds for Bézier curve approximation with cutdown polygon and corner cutting polygon, Improved algorithms for determining the injectivity of 2D and 3D rational Bézier curves, Best bounds on the distance between 3-direction quartic box spline surface and its control net, The Bernstein polynomial basis: a centennial retrospective, Approximation of a continuous curve by its Bernstein-Bézier operator, Error bounds for a class of subdivision schemes based on the two-scale refinement equation, Least squares methods for solving differential equations using Bézier control points., Improved subdivision scheme for the root computation of univariate polynomial equations, Dynamic Bezier curves for variable rate-distortion, Quasi-Bezier curves integrating localised information, Error bounds for a convexity-preserving interpolation and its limit function, Tight numerical bounds for digital terrain modeling by interpolatory subdivision schemes, Estimating error bounds for binary subdivision curves/surfaces, 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, Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization, 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, Topological subtleties for molecular movies, 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, Error bounds for Loop subdivision surfaces
