Using parameters to increase smoothness of curves and surfaces generated by subdivision
Computer Aided Geometric Design
Estimating subdivision depths for rational curves and surfaces
ACM Transactions on Graphics (TOG)
Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
Computer Aided Geometric Design - Special issue dedicated to Paul de Faget de Casteljau
Bounding the distance between 2D parametric Bézier curves and their control polygon
Computing - Geometric modelling dagstuhl 2002
Error bounds for a convexity-preserving interpolation and its limit function
Journal of Computational and Applied Mathematics
A bound on the approximation of a Catmull--Clark subdivision surface by its limit mesh
Computer Aided Geometric Design
Tight numerical bounds for digital terrain modeling by interpolatory subdivision schemes
Mathematics and Computers in Simulation
Hi-index | 7.29 |
We estimate error bounds between binary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parameterizations therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as curve/surface intersection, mesh generation, NC machining, surface rendering and so on.