𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A cocktail algorithm for planar bézier curve intersections

✍ Scribed by Deok-Soo Kim; Soon-Woong Lee; Hayong Shin

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
319 KB
Volume
30
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A subdivision algorithm for generalized
A subdivision algorithm for generalized Bernstein–Bézier curves
✍ M.K. Jena; P. Shunmugaraj; P.C. Das 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 394 KB

In this article we present a computationally efficient subdivision algorithm for the evaluation of generalized Bernstein-Bézier curves. As particular cases we have subdivision algorithms for classical as well as trigonometric Bernstein-Bézier curves.

Bisection algorithms for approximating q
Bisection algorithms for approximating quadratic Bézier curves by G1 arc splines
✍ Jun-Hai Yong; Shi-Min Hu; Jia-Guang Sun 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 293 KB

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

A simple algorithm for designing develop
A simple algorithm for designing developable Bézier surfaces
✍ Günter Aumann 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 564 KB

An algorithm is presented that generates developable Bézier surfaces through a Bézier curve of arbitrary degree and shape. The algorithm has two important advantages. No (nonlinear) characterizing equations have to be solved and the control of singular points is guaranteed. Further interpolation con