Efficient algorithms for Bézier curves
From MaRDI portal
Publication:1978352
DOI10.1016/S0167-8396(99)00048-5zbMath0939.68130OpenAlexW2062868933MaRDI QIDQ1978352
Publication date: 4 June 2000
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8396(99)00048-5
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (11)
Dual functionals of Said-Bézier type generalized Ball bases over triangle domain and their applications ⋮ A shape preserving representation with an evaluation algorithm of linear complexity ⋮ Improved algorithms for determining the injectivity of 2D and 3D rational Bézier curves ⋮ Fast multidimensional Bernstein-Lagrange algorithms ⋮ Error analysis of efficient evaluation algorithms for tensor product surfaces ⋮ Construction of triangular DP surface and its application ⋮ Conversion and evaluation for two types of parametric surfaces constructed by NTP bases ⋮ On the generalized Ball bases ⋮ On computing Bézier curves by Pascal matrix methods ⋮ Progressive iterative approximation and bases with the fastest convergence rates ⋮ Rational Wang?Ball curves
This page was built for publication: Efficient algorithms for Bézier curves