Surface algorithms using bounds on derivatives
The given paper draws a general conclusion about three main algorithms important mostly for their surface application. The mentioned algorithms can be applied for calculation of piecewise linear approximations, all- size-boxes and surface/surface intersections. The best results are achieved by handling all parametric \(C^ 2\) surfaces. These algorithms are related by theorems from approximation theory concerning the maximum deviation possible for an approximation to a surface. Bounds on the partial derivatives have to be known. The generalization of these theorems enables one to work with parametric geometry and shows how to get the necessary bounds.
- A practical guide to splines
- A survey of curve and surface methods in CAGD
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
- Bounds on a polynomial
- Computational techniques for processing parametric surfaces
- scientific article; zbMATH DE number 3782281 (Why is no real title available?)
- scientific article; zbMATH DE number 3537179 (Why is no real title available?)
- scientific article; zbMATH DE number 3613777 (Why is no real title available?)
- scientific article; zbMATH DE number 3232606 (Why is no real title available?)
- Implementation of a divide-and-conquer method for intersection of parametric surfaces
- The distance of a subdivision surface to its control polyhedron
- A new method of evaluating compact geometric bounds for use in subdivision algorithms
- On a tolerance problem of parametric curves and surfaces
- Derivatives of rational Bézier curves
- Directional adaptive surface triangulation
- Surface intersection using parallelism
- Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques
- Improved surface bounds based on derivatives
- A new approach to the surface intersection problem
- Step length problem for trimming curve approximation in tessellating trimmed surfaces
- Bounds on partial derivatives of NURBS surfaces
- High-quality point sampling for B-spline fitting of parametric curves with feature recognition
- 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
- Judging or setting weight steady-state of rational Bézier curves and surfaces
- Sleves for planar spline curves
- Triangulation of \(p\)-order parametric surfaces
- The sharp upper bound on the distance between a parametric patch and its interpolated triangle
- An improvement on the upper bounds of the magnitudes of derivatives of rational triangular Bézier surfaces
- 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
- High-order bisection method for computing invariant manifolds of two-dimensional maps
- scientific article; zbMATH DE number 18392 (Why is no real title available?)
- A New Intersection Algorithm for Parametric Surfaces Based on Linear Interval Estimations
- UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES
- Parametric surface linearization and meshing
- 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
- Change of basis algorithms for surfaces in CAGD
- High-order approximation of conic sections by quadratic splines
- Projection-driven grid-BSP tree for real-time trimming on GPU
- Inverse problem of reconstructing source term for a class of non-divergence parabolic equations
- A local fitting algorithm for converting planar curves to B-splines
- High quality geometric meshing of CAD surfaces
- High quality realtime tessellation of trimmed NURBS surfaces for interactive examination of surface quality on car bodies
This page was built for publication: Surface algorithms using bounds on derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095571)
