Kinetic collision detection for convex fat objects
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1305422 (Why is no real title available?)
- scientific article; zbMATH DE number 1501063 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- A segment-tree based kinetic BSP
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Analysis of a bounding box heuristic for object intersection
- Data Structures for Mobile Data
- Efficient collision detection among moving spheres with unknown trajectories
- Guarding scenes against invasive hypercubes.
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- Kinetic collision detection between two simple polygons.
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- Linear size binary space partitions for uncluttered scenes
- Sharp quantum versus classical query complexity separations
- The complexity of the free space for motion planning amidst fat obstacles
Cited in
(2)
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)