Kinetic collision detection for convex fat objects

DOI10.1007/s00453-007-9019-4zbMath1189.68037WikidataQ59782329 ScholiaQ59782329MaRDI QIDQ1016518

Bettina Speckmann, Mohammad Ali Abam, Sheung-Hung Poon, Mark T. de Berg

Publication date: 6 May 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9019-4

zbMATH Keywords

collision detection; kinetic data structures; fat objects

Mathematics Subject Classification ID

68P05: Data structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Efficient collision detection among moving spheres with unknown trajectories
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Guarding scenes against invasive hypercubes.
• Kinetic collision detection between two simple polygons.
• Linear size binary space partitions for uncluttered scenes
• The complexity of the free space for motion planning amidst fat obstacles
• Sharp quantum versus classical query complexity separations
• Analysis of a bounding box heuristic for object intersection
• Data Structures for Mobile Data
• Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• A segment-tree based kinetic BSP