A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Average case analysis of dynamic geometric optimization
1996
Computational geometry
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log 3 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 2 n) per update and the latter
doi:10.1016/0925-7721(95)00018-6
fatcat:tmaeehsaongfdlnh3zxnsihtsm