查詢結果分析
相關文獻
頁籤選單縮合
題 名 | Computing the Minimum Directed Distances between Convex Polyhedra |
---|---|
作 者 | 施慶隆; 劉建渝; | 書刊名 | Journal of Information Science and Engineering |
卷 期 | 15:3 1999.05[民88.05] |
頁 次 | 頁353-373 |
專 輯 | Special Section on Algorithms |
分類號 | 311.32 |
關鍵詞 | Minimum distance; Minimum directed distance; Minkowski sum; Collision detection; Path planning; |
語 文 | 英文(English) |
英文摘要 | Given two disjointed objects, the minimum distance (MD) is the short Euclidean distance between them. When the two objects intersect, the MD between them is zero. The minimum directed Euclidean distance (MDED) between two objects is the shortest relative translated Euclidean distance that results in the objects coming just into contact. The MDED is also defined for intersecting objects, and it returns a measure of penetration. Given two disjointed objects, we also 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 coming into contact. The MDLD is equivalent to the MDED for two intersecting objects. The computation of MDLD and MDED can be recast as a Minkowski sum of two objects and finished in one routine. The algorithms developed here can be used for collision detection, computation of the distance between two polyhedra in three-dimensional space, and robotics path- planning problems. |
本系統中英文摘要資訊取自各篇刊載內容。