Sciweavers

SODA
1994
ACM
138views Algorithms» more  SODA 1994»
13 years 6 months ago
Average Case Analysis of Dynamic Geometric Optimization
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 geom...
David Eppstein