Bézier nets, convexity and subdivision on higher-dimensional simplices
From MaRDI portal
Publication:674219
DOI10.1016/0167-8396(93)E0057-KzbMath0875.68829OpenAlexW2018111894MaRDI QIDQ674219
Tim N. T. Goodman, Jörg Peters
Publication date: 28 February 1997
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8396(93)e0057-k
Related Items (3)
The mixed directional difference-summation algorithm for generating the Bézier net of a trivariate four-direction box-spline ⋮ Convexity preserving splines over triangulations ⋮ An effective bound on the gap between the control polytype and the graph of a real polynomial on a simplex
Cites Work
- The convexity of Bernstein polynomials over triangles
- Convexity of Bézier nets on triangulations
- On convexity of piecewise polynomial functions on triangulations
- Multivariate Bernstein polynomials and convexity
- Variation diminishing properties of Bernstein polynomials on triangles
- On convex Bézier triangles
- Evaluation and approximate evaluation of the multivariate Bernstein-Bézier form on a regularly partitioned simplex
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bézier nets, convexity and subdivision on higher-dimensional simplices
