Knot line refinement algorithms for tensor product B-spline surfaces
type: Item
instance of: scholarly article
title: Knot line refinement algorithms for tensor product B-spline surfaces
zbMATH Open document ID: 0593.65012
DOI: 10.1016/0167-8396(85)90016-0
author: Tom Lyche
author: Elaine Cohen
author: Knut Mørken
published in: Computer Aided Geometric Design
publication date: 1985-01-01T00:00:00Z
review text: Several refinement and subdivision algorithms for univariate B-spline curves in a tensor product setting. Some considerations lead to a different choice of algorithms in the tensor product case than in the univariate case. In the tensor product case the Oslo algorithm and Boehm's method are used. Also, a numerical example is given.
Mathematics Subject Classification ID: 65D07
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 41A63
zbMATH DE Number: 3954152
zbMATH Keywords: discrete B-splines
zbMATH Keywords: refinement
zbMATH Keywords: subdivision
zbMATH Keywords: Oslo algorithm
zbMATH Keywords: Boehm's method
zbMATH Keywords: numerical example
reviewed by: Antonio López-Carmona
MaRDI profile type: Publication
full work available at URL: 0167-8396(85)90016-0
OpenAlex ID: W1989316862
cites work: Q4112369
cites work: A practical guide to splines
cites work: An improved condition for the convexity of Bernstein-Bézier surfaces over triangles
cites work: Total positivity of the discrete spline collocation matrix
cites work: Making the Oslo Algorithm More Efficient
description: scientific article; zbMATH DE number 3954152