.png){kind=icon}
返回
A vertex algorithm for collision detection
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(98)00370-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An algorithm for detecting the collision of moving objects is presented. The algorithm applies to polyhedral objects that can be represented as convex hulls of finite number of vertices in two- or three-dimensional space. This is then extended to a three- or four-dimensional space (respectively) to represent the objects and their motion. Nonlinear programming techniques are then employed to detect possible interference. The algorithm detects in one step whether or not the objects will interfere during their motion which may involve pure translations or rotations or both. A subalgorithm for computing the minimum distance between the objects is also presented. This can be used to solve the interference detection problem or for more general applications. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
simulation
polytope
convex hull
minimum distance
nonlinear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏分享收藏Substitutive-Inhibitory Gamma Globulin Therapy as Prevention of Stillbirth in Rh–Incompatibility
PREAI
分享收藏分享收藏
Black gold to green gold: regional energy policy and the rehabilitation of coal in response to climate change.png)
Area
OAAI
AreaIF0
OAAI分享收藏
查看更多内容