✦ LIBER ✦

Blossoming and knot insertion algorithms for B-spline curves

✍ Scribed by Ronald N. Goldman

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 897 KB
Volume: 7
Category: Article
ISSN: 0167-8396
DOI: 10.1016/0167-8396(90)90022-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inserting new knots into B-spline curves

✍ Wolfgang Boehm 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 182 KB

For some applications, further subdivision of a segment of a B-spline curve or B-spline surface is desirable. This paper provides an algorithm for this. The structure is similar to de Boor's algorithm for the calculation of a point on a curve. An application of the subdivision is illustrated.

Knot removal for B-spline curves

✍ Matthias Eck; Jan Hadenfeld 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 960 KB

Knot removal for parametric B-spline cur

Knot removal for parametric B-spline curves and surfaces

✍ Tom Lyche; Knut Mørken 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 977 KB

Knot line refinement algorithms for tens

Knot line refinement algorithms for tensor product B-spline surfaces

✍ T. Lyche; E. Cohen; K. Mørken 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 434 KB

Automatic fairing algorithm for B-spline

Automatic fairing algorithm for B-spline curves

✍ N. Sapidis; G. Farin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 782 KB

Knot-removal algorithms for NURBS curves

Knot-removal algorithms for NURBS curves and surfaces

✍ W. Tiller 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 647 KB

The paper presents pseudocode aloorithms, c-lanouaoe code, and error analysis for removino knots from rational B-spline curves and surfaces. Efficient and easy-to-use aloorithms are presented that, with one call, remove all the removable knots from a B-spline curve or surface.