Kinetic collision detection for convex fat objects
From MaRDI portal
Publication:1016518
DOI10.1007/S00453-007-9019-4zbMATH Open1189.68037OpenAlexW2594385885WikidataQ59782329 ScholiaQ59782329MaRDI QIDQ1016518FDOQ1016518
Bettina Speckmann, Sheung-Hung Poon, Mark de Berg, Mohammad A. Abam
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Data Structures for Mobile Data
- Sharp quantum versus classical query complexity separations
- Linear size binary space partitions for uncluttered scenes
- The complexity of the free space for motion planning amidst fat obstacles
- Kinetic collision detection between two simple polygons.
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- Guarding scenes against invasive hypercubes.
- A segment-tree based kinetic BSP
- Analysis of a bounding box heuristic for object intersection
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Efficient collision detection among moving spheres with unknown trajectories
Cited In (1)
This page was built for publication: Kinetic collision detection for convex fat objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016518)
