Pruned Bezier curves

Phillip Barry, Tony D. DeRose, Ronald N. Goldman

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations


The de Casteljau algorithm for evaluating Bezier curves can be represented as a simple data-flow graph where nodes represent either control points or linear interpolation steps. By modifying this graph using an operation called 'pruning,' we generate new curve schemes called 'pruned Bezier curves' that retain many properties of Bezier curves, but have smaller data-flow graphs, and hence can be computed using fewer linear interpolation steps. Many properties of pruned Bezier curves can be determined simply by inspecting the shape of the data-flow graph. In particular, we show that if the frontier of the graph does not oscillate (in a certain easily determined way), then the corresponding curve scheme is variation diminishing.

Original languageEnglish (US)
Pages (from-to)229-238
Number of pages10
JournalProceedings - Graphics Interface
StatePublished - May 1 1990
EventProceedings - Graphics Interface '90 - Halifax, NS, USA
Duration: May 14 1990May 18 1990


Dive into the research topics of 'Pruned Bezier curves'. Together they form a unique fingerprint.

Cite this