An efficient collision detection algorithm of convex polygons based on Minkowski sum

被引：0

作者：

Geng, Qingjia ^{[1
,2
]}

Guo, Xijuan ^{[1
]}

Zhang, Jianfei ^{[1
]}

Zhang, Buying ^{[1
]}

机构：

[1] The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, College of Information Science and Engineering, Yanshan University, No. 438, Hebei Ave., Qinhuangdao 066004, China

[2] College of Computer, Hebei Normal University of Science and Technology, No. 360, West Hebei St., Qinhuangdao 066004, China

来源：

ICIC Express Letters | 2013年 / 7卷 / 02期

关键词：

Collision detection - Collision detection algorithm - Convex polygon - Execution performance - Hot research topics - Key technologies - Minkowski sum - Numerical calculation - Separation distances - Study methods - Virtual assembly simulations;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Collision detection is a hot research topic in the field of path planning of mobile robot, virtual assembly simulation, and so on. Fast and accurate collision detection has become one of the most key technologies of restricting their development. The study method based on Minkowski sum is an effective method for accurate collision detection through accurate numerical calculations. This paper presents a new efficient collision detection algorithm of convex polygons based on Minkowski sum, which uses the minimum separation distance to detect whether two convex polygons collide or not. The algorithm's performance is also analyzed and verified by experiment in the paper. Compared with the traditional collision detection algorithms based on the Minkowski sum, the algorithm's calculation is simpler and execution performance is higher. © 2013 ISSN 1881-803X.

引用

页码：461 / 464

共 50 条

[1] The orientation-distance based collision detection algorithm of convex polygons
Zhang, Buying
Guo, Xijuan
Shu, Li
Liu, Yuanfeng
ICIC Express Letters, 2015, 9 (05): : 1389 - 1392
[2] The distance between convex sets with Minkowski sum structure: application to collision detection
Xiangfeng Wang
Junping Zhang
Wenxing Zhang
Computational Optimization and Applications, 2020, 77 : 465 - 490
[3] The distance between convex sets with Minkowski sum structure: application to collision detection
Wang, Xiangfeng
Zhang, Junping
Zhang, Wenxing
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2020, 77 (02) : 465 - 490
[4] Computing the Minkowski sum of monotone polygons
HernandezBarrera, A
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1997, E80D (02) : 218 - 222
[5] Research on Exact Minkowski Sum Algorithm of convex polyhedron Based on Direct Mapping
Geng, Qingjia
Guo, Xijuan
Zhang, Ya
ADVANCED RESEARCH ON AUTOMATION, COMMUNICATION, ARCHITECTONICS AND MATERIALS, PTS 1 AND 2, 2011, 225-226 (1-2): : 377 - 380
[6] Minkowski decomposition of convex lattice polygons
Emiris, Ioannis Z.
Tsigaridas, Elias P.
ALGEBRAIC GEOMETRY AND GEOMETRIC MODELING, 2006, : 217 - +
[7] Efficient algorithm for transversal of disjoint convex polygons
Chin, FYL
Wang, FL
INFORMATION PROCESSING LETTERS, 2002, 83 (03) : 141 - 144
[8] A Pseudo-Distance Algorithm for Collision Detection of Manipulators Using Convex-Plane-Polygons-based Representation
Xu, Jingjing
Liu, Zhifeng
Yang, Congbin
Li, Longfei
Pei, Yanhu
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2020, 66 (66)
[9] SUM OF MOMENTS OF CONVEX POLYGONS
TOTH, GF
ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1973, 24 (3-4): : 417 - 421
[10] Parallel algorithm for determining possible collision between convex polygons
Li, Qinghua
Gao, Yan
Cui, Guohua
Huazhong Ligong Daxue Xuebao/Journal Huazhong (Central China) University of Science and Technology, 1994, 22 (06):

← 1 2 3 4 5 →