Efficient collision detection for moving polyhedra
Elmar Schömer, Christian Thiel · 1995
In this paper we consider the following problem: given two general polyhedra of complexity n, one of which is moving translationally or rotating about a fixed axis, determine the first collision (if any) between them.We present an algorithm with running time O(n8/5+') for the case of translational movements and running time qn5/3+f f ) or rotational movements, where c is an arbitrary positive constant.This is the first known algorithm with sub-quadratic running time.