Efficient distance computation in configuration space

DOI10.1016/J.CAGD.2008.04.005MaRDI QIDQ735495zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

configuration spacedistance metric

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 821258 (Why is no real title available?)
• scientific article; zbMATH DE number 2238822 (Why is no real title available?)
• A comprehensive introduction to differential geometry. Vol. 1-5
• A fast and practical algorithm for generalized penetration depth computation
• Computing the intersection-depth to polyhedra
• Definition of a kinematic metric for robot manipulators
• Interpolation schemes for rigid body motions
• Nearest neighbor queries in metric spaces
• Planning Algorithms
• Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning
• Randomized path planning for a rigid body based on hardware accelerated Voronoi sampling.
• Spatial Planning: A Configuration Space Approach

Cited in

(12)

• Cost of sequential connection for points in space
• Space-Efficient Approximation Scheme for Circular Earth Mover Distance
• scientific article; zbMATH DE number 5620020 (Why is no real title available?)
• 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
• Fast spatial decomposition and closest pair computation for limited precision input
• Algorithm 990: Efficient atlasing and search of configuration spaces of point-sets constrained by distance intervals

Describes a project that uses

Uses Software

• DiFi

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)