• DocumentCode
    3166204
  • Title

    New formulation for the minimum directed distances between 3D convex polyhedra

  • Author

    Shih, Ching-Long ; Liu, Jane-Yu

  • Author_Institution
    Dept. of Electr. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan
  • Volume
    5
  • fYear
    1995
  • fDate
    22-25 Oct 1995
  • Firstpage
    4095
  • Abstract
    The minimal directed distance function has been shown to have greater freedom in hypothesizing trajectories to be relaxed into admissibility. The minimum directed Euclidean distance (MDED) between two objects is the shortest relative translated Euclidean distance that results in the objects being just in contact. The MDED is also defined for intersecting objects and it then returns a measure of penetration. Given two disjointed objects we define the minimum directed L distance (MDLD) between them to be the shortest size either object needs to grow proportionally that results in the objects being in contact. The MDLD is equivalent to MDED for two intersecting objects and is the shortest relative translated distance so as to separate them. The computation of MDLD and MDED can be recast as a configuration space problem and finished in one routine
  • Keywords
    computational geometry; optimisation; path planning; 3D convex polyhedra; configuration space; convex polyhedra; minimum directed Euclidean distance; minimum directed L distance; object intersection; path planning; Computational geometry; Euclidean distance; Image processing; Information processing; Interference; Motion measurement; Orbital robotics; Path planning; Robotics and automation; Robots;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on
  • Conference_Location
    Vancouver, BC
  • Print_ISBN
    0-7803-2559-1
  • Type

    conf

  • DOI
    10.1109/ICSMC.1995.538432
  • Filename
    538432