Efficient distance computation in configuration space
DOI10.1016/J.CAGD.2008.04.005zbMATH Open1172.65353DBLPjournals/cagd/ZhangKM08OpenAlexW2046927996WikidataQ57425652 ScholiaQ57425652MaRDI QIDQ735495FDOQ735495
Authors: D. Kharzeev 
Publication date: 22 October 2009
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2008.04.005
Recommendations
- A fast and practical algorithm for generalized penetration depth computation
- Interactive generalized penetration depth computation for rigid and articulated models using object norm
- scientific article; zbMATH DE number 740451
- scientific article; zbMATH DE number 2202078
- An accurate distance-calculation algorithm for convex polyhedra
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- A comprehensive introduction to differential geometry. Vol. 1-5
- Title not available (Why is that?)
- Interpolation schemes for rigid body motions
- Planning Algorithms
- Title not available (Why is that?)
- Spatial Planning: A Configuration Space Approach
- Nearest neighbor queries in metric spaces
- Title not available (Why is that?)
- Computing the intersection-depth to polyhedra
- A fast and practical algorithm for generalized penetration depth computation
- Randomized path planning for a rigid body based on hardware accelerated Voronoi sampling.
- Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning
- Definition of a kinematic metric for robot manipulators
Cited In (12)
- Cost of sequential connection for points in space
- Space-Efficient Approximation Scheme for Circular Earth Mover Distance
- Title not available (Why is that?)
- Distance bound for nonconvex polyhedral models in close proximity
- Interactive generalized penetration depth computation for rigid and articulated models using object norm
- An efficient algorithm for computing free distance (Corresp.)
- Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al.
- Representation complexity of adaptive 3D distance fields
- The Boolean map distance: theory and efficient computation
- Generalized penetration depth computation based on kinematical geometry
- Algorithm 990: Efficient atlasing and search of configuration spaces of point-sets constrained by distance intervals
- Fast spatial decomposition and closest pair computation for limited precision input
Uses Software
This page was built for publication: Efficient distance computation in configuration space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735495)
