Kinetic collision detection between two simple polygons

AbstractWe design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the two polygons, called the external relative geodesic triangulation, which certifies their disjointness. We show how this subdivision can be maintained as a kinetic data structure when the polygons are moving, and analyze its performance in the kinetic setting

Force-feedback in virtual environments

Supervised by Mandayam A. Srinivasan.Also issued as Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2000.Includes bibliographical references (leaves 121-127).by Chih-Hao Ho

LIPIcs, Volume 244, ESA 2022, Complete Volume

LIPIcs, Volume 244, ESA 2022, Complete Volum

Efficient Collision Detection for Moving Polyhedra

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(n 8=5+ffl ) for the case of translational movements and running time O(n 5=3+ffl ) for rotational movements, where ffl is an arbitrary positive constant. This is the first known algorithm with sub-quadratic running time. 1 Introduction The demands on quality, security and higher production capacity in manufacturing increase the need for planning during the phase of product design. To find potential faults in the design as soon as possible one uses simulation programs: these predict the physical properties and reactions of the product and check whether particular prefabricated parts can be easily assembled. For the latter purpose, the simulation of assemblies and robots, efficient methods for collision detection are needed...