Optimized refinable enclosures of multivariate polynomial pieces

DOI10.1016/S0167-8396(01)00067-XzbMath0984.68164WikidataQ126572870 ScholiaQ126572870MaRDI QIDQ5958435

David Lutterkort, Jörg Peters

Publication date: 3 March 2002

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

zbMATH Keywords

polynomials; control net; B-spline; Bézier; efficiently computable; multivariate functions; refinable enclosures

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

A simple and efficient approximation of a Bézier piece by its cutdown polygon, Consolidated sharp bounds for Bézier curve approximation with cutdown polygon and corner cutting polygon, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, Lower bound functions for polynomials, Sleves for planar spline curves, Best bounds on the distance between 3-direction quartic box spline surface and its control net, Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon

Uses Software

• OBBTree

Cites Work

• Multivariate Bernstein polynomials and convexity
• Best bounds on the approximation of polynomials and splines by their control structure
• Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
• Tight linear envelopes for splines