Subdivision algorithms with modular arithmetic
From MaRDI portal
Recommendations
Cites work
- \(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves
- A 4-point interpolatory subdivision scheme for curve design
- A butterfly subdivision scheme for surface interpolation with tension control
- A survey of curve and surface methods in CAGD
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
- Analysis of uniform binary subdivision schemes for curve design
- Box splines
- Bézier and B-spline curves with knots in the complex plane
- Computing curves invariant under halving
- Manifold-valued subdivision schemes based on geodesic inductive averaging
- Polyhedral subdivision methods for free-form surfaces
- Symmetric iterative interpolation processes
- The Bernstein polynomial basis: a centennial retrospective
This page was built for publication: Subdivision algorithms with modular arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153624)