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 条

[21] Minkowski decomposition of convex polygons into their symmetric and asymmetric parts
Tuzikov, A
Heijmans, HJAM
PATTERN RECOGNITION LETTERS, 1998, 19 (3-4) : 247 - 254
[22] Convexly independent subsets of Minkowski sums of convex polygons
Skomra, Mateusz
Thomasse, Stephan
DISCRETE MATHEMATICS, 2021, 344 (08)
[23] On Minkowski difference-based contact detection in discrete/discontinuous modelling of convex polygons/polyhedra Algorithms and implementation
Feng, Y. T.
Tan, Yuanqiang
ENGINEERING COMPUTATIONS, 2020, 37 (01) : 54 - 72
[24] A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
Das, Sandip
Dev, Subhadeep Ranjan
Sarvottamananda
DISCRETE APPLIED MATHEMATICS, 2024, 350 : 44 - 61
[25] THE ALGORITHM FOR COMPUTING EXACT MINKOWSKI SUM OF 3D CONVEX POLYHEDRAL
Guo, Xijuan
Geng, Qingjia
Zhang, Ya
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2010, 6 (11): : 5105 - 5114
[26] A collision detection algorithm between convex polyhedrons based on projection of edges
Zhang, Zhi
Zou, Shengtao
Li, Jiatong
Zhang, Lele
Li, Chao
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2015, 27 (08): : 1408 - 1416
[27] Efficient approximation of convex polygons
Lopez, MA
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2000, 10 (05) : 445 - 452
[28] Batch Process and Sensitivity Analysis of Collision Detection of Planar Convex Polygons in Motion
Chen, Cheng-fu
JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING, 2013, 13 (04)
[29] Contributing vertices-based Minkowski sum computation of convex polyhedra
Barki, Hichem
Denis, Florence
Dupont, Florent
COMPUTER-AIDED DESIGN, 2009, 41 (07) : 525 - 538
[30] Minkowski sum volume minimization for convex polyhedra
Tuzikov, AV
Sheynin, SA
MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO IMAGE AND SIGNAL PROCESSING, 2000, 18 : 33 - 40

← 1 2 3 4 5 →