Kinetic collision detection between two simple polygons

13 years 11 months ago

Download reference.kfupm.edu.sa

We 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.

Julien Basch, Jeff Erickson, Leonidas J. Guibas, J

Real-time Traffic

Applied Computing | COMGEO 2004 | Kinetic Data Structure | Polygons | Simple Polygons |

claim paper

» Efficient Collision Detection between 2D Polygons

» Efficient Collision Detection for Moving Ellipsoids Using Separating Planes

» Fast Continuous Collision Detection between Rigid Bodies

» Simple and rapid collision detection using multiple viewing volumes

» A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient S...

» Simple Robots in Polygonal Environments A Hierarchy

» RealTime Collision Detection for Virtual Surgery

» Short and Smooth Polygonal Paths

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMGEO
Authors	Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang

Comments (0)

Sciweavers

Kinetic collision detection between two simple polygons

Applied Computing | COMGEO 2004 | Kinetic Data Structure | Polygons | Simple Polygons |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers