Skip to content

Linear-time Geometric Algorithm for Evaluating Bézier Curves

Authors
Filip Chudy, Pawel Wozny
Year
2018
Journal Paper
Source
Computer-Aided Design
Identifiers
arXiv 1803.06843 DOI 10.1016/j.cad.2019.102760

Abstract

A new algorithm for computing a point on a polynomial or rational curve in Bézier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational complexity is linear with respect to the number of control points and its memory complexity is O(1). Some remarks on similar methods for surfaces in rectangular and triangular Bézier form are also given.

Knowledge Base

Map Tree Search

External

Document arXiv Abstract arXiv PDF arXiv HTML DOI Google Scholar OpenAlex linkinghub.elsevier.com api.elsevier.com api.elsevier.com

Tags

Computational complexity Control Bezier curves Control point

Similar Papers