Distance measures on intersecting objects and their applications
- 24 August 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 51 (4), 181-188
- https://doi.org/10.1016/0020-0190(94)00092-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Computation of certain measures of proximity between convex polytopes: a complexity viewpointPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On computing a distance measure for path planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Computing the intersection-depth of polyhedraAlgorithmica, 1993
- Solution of parametrized linear inequalities by Fourier elimination and its applicationsJournal of Optimization Theory and Applications, 1990
- Visibility and intersection problems in plane geometryDiscrete & Computational Geometry, 1989
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- Distance functions and their application to robot path planning in the presence of obstaclesIEEE Journal on Robotics and Automation, 1985
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983