Skip Navigation

The Computer Journal 1990 33(5):412-416; doi:10.1093/comjnl/33.5.412
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pham, B.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Algorithms for Calculating Cubic Beta-Splines

B. Pham *

Department of Computer Science, Monash University, Clayton 3168 Victoria, Australia

To allow more flexibility for shape control in curve fitting, polynomial Beta-splines were introduced as an extension of polynomial B-splines with bias and tension parameters. It is shown that a segment of a cubic Beta-spline with distinct values for bias and tension parameter at knots can be transformed into a cubic B-spline segment if the control vertices are suitably modified. This gives rise to simple algorithms for calculating Beta-splines. These algorithms compare favourably to three other algorithms given by Goodman/Unsworth, Farin/Boehm and Joe.


Received February 1988. revised January 1989.

* Department of Computer Science, Monash University, Clayton 3168 Victoria, Australia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.