- 期刊
- OpenAccess
Computing the Minimum Directed Distances between Convex Polyhedra
並列摘要
Given two disjointed objects, the minimum distance (MD) is the short Euclid-can 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(superscript ∞) 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.
延伸閱讀
- Liu, C. C. (2010). Efficient Algorithms for Non-Iterative Contact Detection of Convex Polyhedra and Application on Minkowski Sum [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2010.00421
- Hsu, P. W. (2014). Relations Between Polyhedra [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2014.00047
- 周靖江（2004）。Contact and Motion Analysis of Polyhedral Discrete Elements Using Linear and Quadratic Programming〔碩士論文，國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU.2004.00828
- Li, T., & Tian, J. (2012). Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components. Journal of Applied Mathematics, 2012(), 831-843-554. https://doi.org/10.1155/2012/689820
- 彭君智（2000）。Something About the Unfold Polyhedra。科學教育月刊，(234)，11-17。https://doi.org/10.6216/SEM.200011_(234).0002