Knot line refinement algorithms for tensor product B-spline surfaces

DOI10.1016/0167-8396(85)90016-0zbMath0593.65012OpenAlexW1989316862MaRDI QIDQ1076475

Tom Lyche, Elaine Cohen, Knut M. Mørken

Publication date: 1985

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(85)90016-0

zbMATH Keywords

numerical examplesubdivisionrefinementdiscrete B-splinesOslo algorithmBoehm's method

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Multidimensional problems (41A63) Spline approximation (41A15)

Related Items

Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ On the efficiency of knot insertion algorithms ⋮ Knot insertion from a blossoming point of view ⋮ Recursive representation and application of transformation matrices of B-spline bases ⋮ Truncated T-splines: fundamentals and methods ⋮ Approximate conversion of rational B-spline patches ⋮ Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques

Cites Work

• Unnamed Item
• Total positivity of the discrete spline collocation matrix
• An improved condition for the convexity of Bernstein-Bézier surfaces over triangles
• A practical guide to splines
• Making the Oslo Algorithm More Efficient