Given a convex function \(f\) without any smoothness requirements on its derivatives, we estimate its error of approximation by \(\mathbf{C}^{1}\) convex quadratic splines in terms of \(\omega_{3}(f, 1 / n)\). C 1993 Academic Press, Inc.
Approximating quadratic NURBS curves by arc splines
β Scribed by D.S. Meek; D.J. Walton
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 447 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
β¦ Synopsis
When a quadratic NURBS curve is used to describe the path of a computer-controlled cuttin9 machine, the NURBS curve is usually approximated by many straight-line segments. It is preferable to describe the cutting path as an arc spline, a tangent-continuous, piecewise curve made of circular arcs and straioht-line segments. The paper presents an algorithm for finding an arbitrarily close arc-spline approximation to a quadratic NURBS curve. arc splines, quadratic NURBS curves
π SIMILAR VOLUMES
In a recent paper by Hu it is proved that for any convex function f there is a C 1 convex quadratic spline s with n knots that approximates f at the rate of | 3 ( f, n &1 ). The knots of the spline are basically equally spaced. In this paper we give a simple construction of such a spline with equall
Given a parametric plane curve \(\mathbf{p}\) and any BΓ©zier curve \(\mathbf{q}\) of degree \(n\) such that \(\mathbf{p}\) and \(q\) have contact of order \(k\) at the common end points, we use the normal vector field of \(\mathbf{p}\) to measure the distance of corresponding points of \(\mathbf{p}\
The approximation of plane curves by smooth piecewise circular arc curves In Tchebycheff norm is analysed. The algorithm of approximation is proposed. It is proved that algorithm presented generates for curves of some class, called spirals, the minimal number of circular arcs. Results ere used to ev