Surface algorithms using bounds on derivatives
From MaRDI portal
Publication:1095571
DOI10.1016/0167-8396(86)90005-1zbMath0632.65013OpenAlexW1989513862MaRDI QIDQ1095571
Robert Markot, Robert Magedson, Daniel J. Filip
Publication date: 1986
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8396(86)90005-1
algorithmscomputer aided geometric designpiecewise linear approximationsparametric geometryall- size-boxessurface/surface intersections
Surfaces in Euclidean and related spaces (53A05) Algorithms for approximation of functions (65D15) Descriptive geometry (51N05) Graphical methods in numerical analysis (65S05)
Related Items
HIGH-ORDER BISECTION METHOD FOR COMPUTING INVARIANT MANIFOLDS OF TWO-DIMENSIONAL MAPS, Sleves for planar spline curves, Bounds on partial derivatives of NURBS surfaces, A New Intersection Algorithm for Parametric Surfaces Based on Linear Interval Estimations, Improved surface bounds based on derivatives, A new approach to the surface intersection problem, A simple and efficient approximation of a Bézier piece by its cutdown polygon, Minimizing the maximal ratio of weights of rational Bézier curves and surfaces, A new method of evaluating compact geometric bounds for use in subdivision algorithms, High-order approximation of conic sections by quadratic splines, On a tolerance problem of parametric curves and surfaces, Derivatives of rational Bézier curves, Triangulation of \(p\)-order parametric surfaces, The sharp upper bound on the distance between a parametric patch and its interpolated triangle, Parametric surface linearization and meshing, Precise Hausdorff distance computation for freeform surfaces based on computations with osculating toroidal patches, Self-intersection computation for freeform surfaces based on a regional representation scheme for miter points, UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES, High-quality point sampling for B-spline fitting of parametric curves with feature recognition, An improvement on the upper bounds of the magnitudes of derivatives of rational triangular Bézier surfaces, A local fitting algorithm for converting planar curves to B-splines, Directional adaptive surface triangulation, The distance of a subdivision surface to its control polyhedron, Minimizing the maximal ratio of weights of a rational Bézier curve, Smooth surface extension with curvature bound, Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon, Surface intersection using parallelism, Step length problem for trimming curve approximation in tessellating trimmed surfaces, Judging or setting weight steady-state of rational Bézier curves and surfaces, Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of curve and surface methods in CAGD
- Bounds on a polynomial
- A practical guide to splines
- Implementation of a divide-and-conquer method for intersection of parametric surfaces
- Computational techniques for processing parametric surfaces
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
