Fast algorithms for collision and proximity problems involving moving geometric objects
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1305422
- LP-Based Algorithms for Detecting the Collision of Moving Objects
- On the collision detection problem of two moving objects described by algebraic sets
- An optimal algorithm for solving collision distance between convex polygons in plane
- Collision computation of moving bodies
Cites work
- Adding range restriction capability to dynamic data structures
- Applications of Parametric Searching in Geometric Optimization
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Cutting hyperplane arrangements
- Diameter, width, closest line pair, and parametric searching
- Efficient partition trees
- Methods of centre manifold and multiple scales in the theory of weakly nonlinear stability for fluid motions
- Minimum spanning trees of moving points in the plane
- Range searching with efficient hierarchical cuttings
- Some dynamic computational geometry problems
- The power of geometric duality
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
Cited in
(9)- An optimal algorithm for solving collision distance between convex polygons in plane
- Kinetic collision detection between two simple polygons.
- Improved Generic Algorithms for 3-Collisions
- A sensor-based framework for kinetic data compression
- Optimal algorithms for geometric centers and depth
- Parametric search made practical
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
- Efficient collision detection among moving spheres with unknown trajectories
- Approximation algorithm for the kinetic robust \(k\)-center problem
This page was built for publication: Fast algorithms for collision and proximity problems involving moving geometric objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126250)
