| Computing Diameter in the Streaming and (2008) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diameter requires \Omega (n) bits of space. We present a simple ffl-approximation6 algorithm for computing the diameter in the streaming model. Our main result is an ffl-approximation algorithm that maintains the diameter in two dimensions in the sliding-window model using O ( 1ffl3/2 log3 n(log R+log log n+ log 1ffl)) bits of space, where R is the maximum, over all windows, of the ratio of the diameter to the minimum non-zero distance between any two points in the window. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||