Kinetic collision detection between two simple polygons.
From MaRDI portal
Publication:1428461
DOI10.1016/j.comgeo.2003.11.001zbMath1054.65017OpenAlexW2002906321MaRDI QIDQ1428461
Leonidas J. Guibas, J. E. Hershberger, Jeff Erickson, Julien Basch, L. Zhang
Publication date: 29 March 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2003.11.001
Related Items
Kinetic collision detection with fast flight plan changes ⋮ Resolving Loads with Positive Interior Stresses ⋮ Kinetic and dynamic data structures for convex hulls and upper envelopes ⋮ A kinetic triangulation scheme for moving points in the plane ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ Kinetic facility location ⋮ Kinetic collision detection for balls ⋮ Kinetic collision detection for convex fat objects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast algorithms for collision and proximity problems involving moving geometric objects
- Ray shooting in polygons using geodesic triangulations
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Topologically sweeping visibility complexes via pseudotriangulations
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Data Structures for Mobile Data
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- Planar minimally rigid graphs and pseudo-triangulations
