Fast and Simple Methods For Computing Control Points
| dc.creator | Gallier, Jean | |
| dc.creator | Gu, Weqing | |
| dc.date | 2006-06-13 | |
| dc.date.accessioned | 2026-07-07T07:13:03Z | |
| dc.date.available | 2026-07-07T07:13:03Z | |
| dc.description | The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials (written as sums of monomials). We give recurrence formulae w.r.t. arbitrary affine frames. As a corollary, it is amusing that we can also give closed-form expressions in the case of the frame (r, s) for curves, and the frame ((1, 0, 0), (0, 1, 0), (0, 0, 1) for surfaces. Our methods have the same low polynomial (time and space) complexity as the other best known algorithms, and are very easy to implement. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0606056 | |
| dc.identifier | http://arxiv.org/abs/cs/0606056 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/112305 | |
| dc.subject | Computational Complexity | |
| dc.subject | Graphics | |
| dc.title | Fast and Simple Methods For Computing Control Points | |
| dc.type | text |