SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Surface algorithms using bounds on derivatives
Computer Aided Geometric Design
Fat arcs: a bounding region with cubic convergence
Computer Aided Geometric Design
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Smooth paths in a polygonal channel
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
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
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Best bounds on the approximation of polynomials and splines by their control structure
Computer Aided Geometric Design
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Bezier and B-Spline Techniques
Bezier and B-Spline Techniques
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Approximation by Interval Bezier Curves
IEEE Computer Graphics and Applications
Tight Bounding Volumes for Subdivision Surfaces
PG '98 Proceedings of the 6th Pacific Conference on Computer Graphics and Applications
Efficient collision detection for interactive three-dimensional graphics and virtual environments
Efficient collision detection for interactive three-dimensional graphics and virtual environments
Kinetic data structures
Envelopes of nonlinear geometry
Envelopes of nonlinear geometry
Optimized refinable enclosures of multivariate polynomial pieces
Computer Aided Geometric Design
Constrained curve drawing using trigonometric splines having shape parameters
Computer-Aided Design
Dual evolution of planar parametric spline curves and T-spline level sets
Computer-Aided Design
Constrained curve fitting on manifolds
Computer-Aided Design
Homotopy Conditions for Tolerant Geometric Queries
Reliable Implementation of Real Number Algorithms: Theory and Practice
Efficient sparse voxel octrees
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
SMI 2012: Full Curve intersection using hybrid clipping
Computers and Graphics
Technical note: Voronoi diagrams of algebraic distance fields
Computer-Aided Design
| Hi-index | 0.00 |
Given a planar spline curve and local tolerances, a matched pair of polygons is computed that encloses the curve and whose width (distance between corresponding break points) is below the tolerances. This is the simplest instance of a subdividable linear efficient variety enclosure, short sleve.We develop general criteria, that certify correctness of a global, polygonal enclosure built from a sequence of individual bounding boxes by extending and intersecting their edges. These criteria prove correctness of the sleve construction.