Fast algorithms for collision and proximity problems involving moving geometric objects
DOI10.1016/0925-7721(95)00028-3zbMATH Open0857.68107OpenAlexW2034208294MaRDI QIDQ1126250FDOQ1126250
Authors: Prosenjit Gupta, Ravi Janardan, Michiel Smid 
Publication date: 8 December 1996
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-B50E-D
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Cites Work
- Efficient partition trees
- The power of geometric duality
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Adding range restriction capability to dynamic data structures
- Some dynamic computational geometry problems
- Applications of Parametric Searching in Geometric Optimization
- Range searching with efficient hierarchical cuttings
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
- Cutting hyperplane arrangements
- Methods of centre manifold and multiple scales in the theory of weakly nonlinear stability for fluid motions
- Diameter, width, closest line pair, and parametric searching
- Minimum spanning trees of moving points in the plane
Cited In (9)
- Optimal Algorithms for Geometric Centers and Depth
- Improved Generic Algorithms for 3-Collisions
- Approximation algorithm for the kinetic robust \(k\)-center problem
- An optimal algorithm for solving collision distance between convex polygons in plane
- A sensor-based framework for kinetic data compression
- Kinetic collision detection between two simple polygons.
- Parametric search made practical
- Efficient collision detection among moving spheres with unknown trajectories
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
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)
