Average Case Analysis of Dynamic Geometric Optimization

  title={Average Case Analysis of Dynamic Geometric Optimization},
  author={David Eppstein},
  journal={Comput. Geom.},
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log n) expected time per update in Mulmuley’s average-case model of dynamic geometric computation. We use as subroutines dynamic algorithms for two other geometric graphs: the farthest neighbor forest and the rotating caliper graph related to an algorithm for static computation of point set widths and diameters. We maintain the former graph in expected time O(log n) per update and the latter in… CONTINUE READING
10 Citations
6 References
Similar Papers


Publications referenced by this paper.
Showing 1-6 of 6 references

Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees

  • P. K. Agarwal, D. Eppstein, J. Matoušek
  • In Proc. 33rd IEEE Symp. Foundations of Computer…
  • 1992
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…