Representation complexity of adaptive 3D distance fields
From MaRDI portal
Publication:632926
DOI10.1016/j.amc.2011.01.072zbMath1211.65023OpenAlexW2102316910MaRDI QIDQ632926
Bernardo Llanas, Francisco Javier Sáinz
Publication date: 28 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.072
numerical examplesmotion planningtree approximationconvex polyhedraadaptive splittingdistance computationdistance fieldsHausdorff matchingrepresentation complexity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive approximation by multivariate smooth splines
- An adaptive algorithm for multivariate approximation giving optimal convergence rates
- Asymptotically efficient triangulations of the \(d\)-cube
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- Level set methods and dynamic implicit surfaces
- Fast computation in adaptive tree approximation
- A hierarchical method for real-time distance computation among moving convex bodies
- Heterogeneous material modeling with distance fields
- Hausdorff matching and Lipschitz optimization
- Lower bounds for simplicial covers and triangulations of cubes
- Degree of Adaptive Approximation
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- The quickhull algorithm for convex hulls
- Finite volume distance field and its application to medial axis transforms
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
This page was built for publication: Representation complexity of adaptive 3D distance fields
