A space-optimal data-stream algorithm for coresets in the plane

DOI10.1145/1247069.1247071zbMath1209.68573OpenAlexW2038647971MaRDI QIDQ3602850

Hai Yu, Pankaj K. Agarwal

Publication date: 12 February 2009

Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1247069.1247071

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (11)

Dynamic coresets ⋮ Streaming and dynamic algorithms for minimum enclosing balls in high dimensions ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Simplified Planar Coresets for Data Streams ⋮ An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions ⋮ Approximate Convex Hull of Data Streams ⋮ A streaming algorithm for 2-center with outliers in high dimensions ⋮ An almost space-optimal streaming algorithm for coresets in fixed dimensions ⋮ Streaming algorithms for line simplification ⋮ Robust shape fitting via peeling and grating coresets ⋮ Streaming algorithms for extent problems in high dimensions

This page was built for publication: A space-optimal data-stream algorithm for coresets in the plane