Average case analysis of dynamic geometric optimization

6Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-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 time O(log2 n) per update and the latter in time O(log n) per update. We also use the rotating caliper graph to maintain the diameter, width, and minimum enclosing rectangle in time O(log n) per update.

Cite

CITATION STYLE

APA

Eppstein, D. (1994). Average case analysis of dynamic geometric optimization. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (pp. 77–86). Publ by ACM.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free