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 条

[41] A SEMIRING ON CONVEX POLYGONS AND ZERO-SUM CYCLE PROBLEMS
IWANO, K
STEIGLITZ, K
SIAM JOURNAL ON COMPUTING, 1990, 19 (05) : 883 - 901
[42] Contributing vertices-based Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron
Barki, Hichem
Denis, Florence
Dupont, Florent
SMI 2009: IEEE INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDINGS, 2009, : 73 - 80
[43] Contributing Vertices-Based Minkowski Sum of a Nonconvex-Convex Pair of Polyhedra
Barki, Hichem
Denis, Florence
Dupont, Florent
ACM TRANSACTIONS ON GRAPHICS, 2011, 30 (01):
[44] An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing
Evgeny Lipovetsky
Nira Dyn
Advances in Computational Mathematics, 2007, 26 : 269 - 282
[45] An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing
Lipovetsky, Evgeny
Dyn, Nira
ADVANCES IN COMPUTATIONAL MATHEMATICS, 2007, 26 (1-3) : 269 - 282
[46] Efficient algorithm for transversal of disjoint convex polygons (vol 83, pg 141, 2002)
Chin, FYL
Wang, FL
INFORMATION PROCESSING LETTERS, 2003, 85 (01) : 53 - 53
[47] A NEW LINEAR ALGORITHM FOR INTERSECTING CONVEX POLYGONS
OROURKE, J
CHIEN, CB
OLSON, T
NADDOR, D
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1982, 19 (04): : 384 - 391
[48] Approximation algorithm for cutting out convex polygons
Dumitrescu, A
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2004, 29 (03): : 223 - 231
[49] THE MAXIMUM NUMBER OF FACES OF THE MINKOWSKI SUM OF THREE CONVEX POLYTOPES
Karavelas, Menelaos I.
Konaxis, Christos
Tzanaki, Eleni
JOURNAL OF COMPUTATIONAL GEOMETRY, 2015, 6 (01) : 21 - 74
[50] The Maximum Number of Faces of the Minkowski Sum of Three Convex Polytopes
Karavelas, Menelaos I.
Konaxis, Christos
Tzanaki, Eleni
PROCEEDINGS OF THE TWENTY-NINETH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SOCG'13), 2013, : 187 - 196

← 1 2 3 4 5 →