New distances for the separation and penetration of objects

This publication has 12 references indexed in Scilit:

• A fast algorithm for incremental distance calculation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Robot path planning with penetration growth distance
  Journal of Robotic Systems, 1998
• Robot Motion Planning
  Published by Springer Nature ,1991
• Computing the distance between general convex objects in three-dimensional space
  IEEE Transactions on Robotics and Automation, 1990
• A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra
  The International Journal of Robotics Research, 1989
• A fast procedure for computing the distance between complex objects in three-dimensional space
  IEEE Journal on Robotics and Automation, 1988
• Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
  Discrete & Computational Geometry, 1987
• Determining the minimum translational distance between two convex polyhedra
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• A linear algorithm for determining the separation of convex polyhedra
  Journal of Algorithms, 1985
• Linear Programming in Linear Time When the Dimension Is Fixed
  Journal of the ACM, 1984