De Casteljau's Algorithm Revisited

Jens Gravesen

De Casteljau's Algorithm Revisited

Research output: Book/Report › Report › Research › peer-review

Abstract

It is demonstrated how all the basic properties of Bezier curvescan be derived swiftly and efficiently without any reference tothe Bernstein polynomials and essentially with only geometricarguments. This is achieved by viewing one step in de Casteljau'salgorithm as an operator (de Casteljau's operator) actingon a sequence of points, producing a sequence with one pointless. The properties of Bezier curves are derived by analysingde Casteljau's operator.

Original language	English

Number of pages	8
Publication status	Published - 1996

Cite this

@book{875d379434b84c96b373a63170d61585,

title = "De Casteljau's Algorithm Revisited",

abstract = "It is demonstrated how all the basic properties of Bezier curvescan be derived swiftly and efficiently without any reference tothe Bernstein polynomials and essentially with only geometricarguments. This is achieved by viewing one step in de Casteljau'salgorithm as an operator (de Casteljau's operator) actingon a sequence of points, producing a sequence with one pointless. The properties of Bezier curves are derived by analysingde Casteljau's operator.",

author = "Jens Gravesen",

year = "1996",

language = "English",

}

TY - RPRT

T1 - De Casteljau's Algorithm Revisited

AU - Gravesen, Jens

PY - 1996

Y1 - 1996

N2 - It is demonstrated how all the basic properties of Bezier curvescan be derived swiftly and efficiently without any reference tothe Bernstein polynomials and essentially with only geometricarguments. This is achieved by viewing one step in de Casteljau'salgorithm as an operator (de Casteljau's operator) actingon a sequence of points, producing a sequence with one pointless. The properties of Bezier curves are derived by analysingde Casteljau's operator.

AB - It is demonstrated how all the basic properties of Bezier curvescan be derived swiftly and efficiently without any reference tothe Bernstein polynomials and essentially with only geometricarguments. This is achieved by viewing one step in de Casteljau'salgorithm as an operator (de Casteljau's operator) actingon a sequence of points, producing a sequence with one pointless. The properties of Bezier curves are derived by analysingde Casteljau's operator.

M3 - Report

BT - De Casteljau's Algorithm Revisited

ER -