A comprehensive comparison of algorithms for evaluating rational Bézier curves
From MaRDI portal
Publication:6632488
DOI10.14658/PUPJ-DRNA-2024-3-9MaRDI QIDQ6632488
Kai Hormann, Chiara Fuda, Andriamahenina Ramanantoanina
Publication date: 4 November 2024
Published in: Dolomites Research Notes on Approximation (Search for Journal in Brave)
Curves in Euclidean and related spaces (53A04) Computer-aided design (modeling of curves and surfaces) (65D17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On computing Bézier curves by Pascal matrix methods
- Efficient computation of Bézier curves from their Bernstein-Fourier representation
- Efficient evaluation of multivariate polynomials
- On de Casteljau's algorithm
- Efficient algorithms for Bézier curves
- New shape control tools for rational Bézier curve design
- On the numerical stability of linear barycentric rational interpolation
- A shape preserving representation with an evaluation algorithm of linear complexity
- Vandermonde factorizations of a regular Hankel matrix and their application to the computation of Bézier curves
- Rational Wang?Ball curves
- MPFR
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
This page was built for publication: A comprehensive comparison of algorithms for evaluating rational Bézier curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632488)
