Fast algorithms for collision and proximity problems involving moving geometric objects
From MaRDI portal
Publication:1126250
DOI10.1016/0925-7721(95)00028-3zbMath0857.68107OpenAlexW2034208294MaRDI QIDQ1126250
Ravi Janardan, Prosenjit Gupta, Michiel H. M. 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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (6)
Parametric search made practical ⋮ Kinetic collision detection between two simple polygons. ⋮ A sensor-based framework for kinetic data compression ⋮ Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points ⋮ Approximation algorithm for the kinetic robust \(k\)-center problem ⋮ Optimal Algorithms for Geometric Centers and Depth
Cites Work
- Range searching with efficient hierarchical cuttings
- Diameter, width, closest line pair, and parametric searching
- Some dynamic computational geometry problems
- The power of geometric duality
- Cutting hyperplane arrangements
- Efficient partition trees
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Adding range restriction capability to dynamic data structures
- Methods of centre manifold and multiple scales in the theory of weakly nonlinear stability for fluid motions
- Applications of Parametric Searching in Geometric Optimization
- Minimum spanning trees of moving points in the plane
This page was built for publication: Fast algorithms for collision and proximity problems involving moving geometric objects
