Simplified Planar Coresets for Data Streams

  • Authors:
  • John Hershberger;Subhash Suri

  • Affiliations:
  • Mentor Graphics Corp., Wilsonville, USA OR 97070;Computer Science Department, University of California, Santa Barbara, USA CA 93106

  • Venue:
  • SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

We propose a simple, optimal-space algorithm for maintaining an extent coreset for a data stream of points in the plane. For a given parameter r, the coreset consists of a sample of 茂戮驴(r) points from the stream seen so far. The coreset property is that for any slab (defined by two parallel lines) that encloses the sample, a (1 + 茂戮驴) expansion of the slab encloses all the stream points seen so far, for 茂戮驴= O(1/r2). The coreset can be maintained in O(logr) amortized time per point of the stream.