Average case analysis of dynamic geometric optimization
- 30 April 1996
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 6 (1) , 45-68
- https://doi.org/10.1016/0925-7721(95)00018-6
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Dynamic Point Location in General SubdivisionsJournal of Algorithms, 1994
- Offline Algorithms for Dynamic Minimum Spanning Tree ProblemsJournal of Algorithms, 1994
- Fully dynamic delaunay triangulation in logarithmic expected time per operationComputational Geometry, 1992
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- Farthest neighbors, maximum spanning trees and related problems in higher dimensionsComputational Geometry, 1992
- Maintenance of a minimum spanning forest in a dynamic plane graphJournal of Algorithms, 1992
- Off-line dynamic maintenance of the width of a planar point setComputational Geometry, 1991
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979