Multivariate Bernstein polynomials and convexity
Computer Aided Geometric Design
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
Computer Aided Geometric Design - Special issue dedicated to Paul de Faget de Casteljau
Best bounds on the approximation of polynomials and splines by their control structure
Computer Aided Geometric Design
Lower bound functions for polynomials
Journal of Computational and Applied Mathematics
SLEVEs for planar spline curves
Computer Aided Geometric Design
Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon
Computer Aided Geometric Design
ACM SIGGRAPH 2002 conference abstracts and applications
A simple and efficient approximation of a Bézier piece by its cutdown polygon
Computer Aided Geometric Design
Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon
Computer Aided Geometric Design
Computer Aided Geometric Design
Efficient piecewise linear approximation of bézier curves with improved sharp error bound
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
SMI 2012: Full Curve intersection using hybrid clipping
Computers and Graphics
| Hi-index | 0.00 |
An enclosure is a two-sided approximation of a uni- or multivariate function b@?B by a pair of typically simpler functions b^+,b^-@?HB such that b^-=