𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bisection algorithms for approximating quadratic Bézier curves by G1 arc splines

✍ Scribed by Jun-Hai Yong; Shi-Min Hu; Jia-Guang Sun

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
293 KB
Volume
32
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

✦ Synopsis

To describe the tool path of a CNC machine, it is often necessary to approximate curves by G 1 arc splines with the number of arc segments as small as possible. Ahn et al. have proposed an iterative algorithm for approximating quadratic Be ´zier curves by G 1 arc splines with fewer arc segments than the biarc method. This paper gives the formula of the upper bound for arc segments used by their algorithm. Based on the formula, two kinds of bisection algorithms for approximating quadratic Be ´zier curves by G 1 arc splines are presented. Results of some examples illustrate their efficiency.

📜 SIMILAR VOLUMES

G1 arc spline approximation of quadratic
G1 arc spline approximation of quadratic Bézier curves
✍ Young Joon Ahn; Hong Oh Kim; Kyoung-Yong Lee 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 615 KB

In describing the tool path for a certain CNC machine, it is often required to approximate Bezier curves by arc splines with the number of arc segments as small as possible. We give a new method for approximating quadratic BCzier curves by G' arc splines with smaller number of arc segments than the

Approximating quadratic NURBS curves by
Approximating quadratic NURBS curves by arc splines
✍ D.S. Meek; D.J. Walton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 447 KB

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