๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Automatic fairing algorithm for B-spline curves

โœ Scribed by N. Sapidis; G. Farin

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
782 KB
Volume
22
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithm for degree reduction of B-spli
Algorithm for degree reduction of B-spline curves
โœ Les Piegl; Wayne Tiller ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 899 KB

An algorithmic approach to degree reduction of B-spline curves is presented. The method consists of the following steps: (a) decompose the B-spline curve into Btzier pieces on the fly, (b) degree reduce each Btzier piece, and (c) remove the unnecessary knots. A complete algorithm and precise error

An efficient algorithm for generating B-
An efficient algorithm for generating B-spline interpolation curves and surfaces from B-spline approximations
โœ Wang, Hui Ping ;Hewgill, Denton E. ;Vickers, Geoffrey W. ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 302 KB ๐Ÿ‘ 1 views

A useful and simple algorithm is presented for interactively generating B-spline interpolation curves and surfaces from B-spline approximation solutions. The difference between the data points and the B-spline approximation is used to modify the control vertices in order to generate a succession of

Curve and surface representation for Bez
Curve and surface representation for Bezier B-spline systems
โœ PJ Hartley; CJ Judd ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB

This paper briefly outlines the design' and application of two potential display processor components in future computeraided design systems. Most of the applications derive from the high-speed graphics facilities with automatic hidden-line" removal -however some depend on an overlap testing procedu