A short proof of the Oslo algorithm (Q801629): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8396(84)90007-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025815503 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On calculating with B-splines / rank | |||
Normal rank | |||
Latest revision as of 16:11, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of the Oslo algorithm |
scientific article |
Statements
A short proof of the Oslo algorithm (English)
0 references
1984
0 references
A short proof of the Oslo-algorithm [cf. \textit{E. Cohen} et al., Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics, Comput. Graphics Image Process. 14, 87-111 (1980)] is presented that uses a simple comparison of coefficients.
0 references
Oslo-algorithm
0 references
B-splines
0 references
