Efficient algorithms for Bézier curves
From MaRDI portal
Publication:1978352
Recommendations
- Efficient computation of Bézier curves from their Bernstein-Fourier representation
- scientific article; zbMATH DE number 2121918
- Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm
- Computing values and derivatives of Bézier and B-spline tensor products
- Efficient algorithms for the implementations of \(B\)-splines
Cited in
(18)- On the generalized Ball bases
- Conversion and evaluation for two types of parametric surfaces constructed by NTP bases
- Progressive iterative approximation and bases with the fastest convergence rates
- Construction of triangular DP surface and its application
- Rational Wang?Ball curves
- An algorithm generating variable-step Bézier curves based on the principle of locality
- On computing Bézier curves by Pascal matrix methods
- Efficient computation of Bézier curves from their Bernstein-Fourier representation
- scientific article; zbMATH DE number 1188863 (Why is no real title available?)
- A shape preserving representation with an evaluation algorithm of linear complexity
- Dual functionals of Said-Bézier type generalized Ball bases over triangle domain and their applications
- Improved algorithms for determining the injectivity of 2D and 3D rational Bézier curves
- A comprehensive comparison of algorithms for evaluating rational Bézier curves
- On the efficiency of knot insertion algorithms
- Fast multidimensional Bernstein-Lagrange algorithms
- Error analysis of efficient evaluation algorithms for tensor product surfaces
- scientific article; zbMATH DE number 4119475 (Why is no real title available?)
- Fast evaluation of derivatives of Bézier curves
This page was built for publication: Efficient algorithms for Bézier curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978352)