Fast algorithms for collision and proximity problems involving moving geometric objects
- 30 November 1996
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 6 (6) , 371-391
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANEInternational Journal of Computational Geometry & Applications, 1991
- Minimum spanning trees of moving points in the planeIEEE Transactions on Computers, 1991
- Computational Geometry--An Introduction.Mathematics of Computation, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Adding range restriction capability to dynamic data structuresJournal of the ACM, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Dynamical sets of pointsComputer Vision, Graphics, and Image Processing, 1984
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983