Pages that link to "Item:Q1126250"
From MaRDI portal
The following pages link to Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250):
Displaying 9 items.
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- Parametric search made practical (Q598230) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- Efficient collision detection among moving spheres with unknown trajectories (Q818668) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900) (← links)
- Kinetic collision detection between two simple polygons. (Q1428461) (← links)
- Improved Generic Algorithms for 3-Collisions (Q3650702) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)