Dynamic Streaming Algorithms for Epsilon-Kernels

Author Timothy M. Chan

Thumbnail PDF


  • Filesize: 0.5 MB
  • 11 pages

Document Identifiers

Author Details

Timothy M. Chan

Cite AsGet BibTex

Timothy M. Chan. Dynamic Streaming Algorithms for Epsilon-Kernels. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 27:1-27:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Introduced by Agarwal, Har-Peled, and Varadarajan [J. ACM, 2004], an epsilon-kernel of a point set is a coreset that can be used to approximate the width, minimum enclosing cylinder, minimum bounding box, and solve various related geometric optimization problems. Such coresets form one of the most important tools in the design of linear-time approximation algorithms in computational geometry, as well as efficient insertion-only streaming algorithms and dynamic (non-streaming) data structures. In this paper, we continue the theme and explore dynamic streaming algorithms (in the so-called turnstile model). Andoni and Nguyen [SODA 2012] described a dynamic streaming algorithm for maintaining a (1+epsilon)-approximation of the width using O(polylog U) space and update time for a point set in [U]^d for any constant dimension d and any constant epsilon>0. Their sketch, based on a "polynomial method", does not explicitly maintain an epsilon-kernel. We extend their method to maintain an epsilon-kernel, and at the same time reduce some of logarithmic factors. As an application, we obtain the first randomized dynamic streaming algorithm for the width problem (and related geometric optimization problems) that supports k outliers, using poly(k, log U) space and time.
  • coresets
  • streaming algorithms
  • dynamic algorithms
  • polynomial method
  • randomization
  • outliers


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Pankaj K. Agarwal, Sariel Har-Peled, and Kasturi R. Varadarajan. Approximating extent measures of points. J. ACM, 51(4):606-635, 2004. Google Scholar
  2. Pankaj K. Agarwal, Sariel Har-Peled, and Kasturi R. Varadarajan. Geometric approximation via coresets. In Emo Welzl, editor, Current Trends in Combinatorial and Computational Geometry, pages 1-30. Cambridge University Press, 2005. Google Scholar
  3. Pankaj K. Agarwal, Sariel Har-Peled, and Hai Yu. Robust shape fitting via peeling and grating coresets. Discrete & Computational Geometry, 39(1-3):38-58, 2008. URL: http://dx.doi.org/10.1007/s00454-007-9013-2.
  4. Pankaj K. Agarwal, Jeff M. Phillips, and Hai Yu. Stability of ε-kernels. In Proceedings of the 18th Annual European Symposium on Algorithms, Part I, pages 487-499, 2010. URL: http://dx.doi.org/10.1007/978-3-642-15775-2_42.
  5. Alexandr Andoni and Huy L. Nguyen. Width of points in the streaming model. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 447-452, 2012. ACM Trans. Algorithms, to appear. Google Scholar
  6. Sunil Arya and Timothy M. Chan. Better ε-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and ε-kernels. In Proceedings of the 30th Annual Symposium on Computational Geometry, pages 416-425, 2014. URL: http://dx.doi.org/10.1145/2582112.2582161.
  7. Gill Barequet and Sariel Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algorithms, 38(1):91-109, 2001. Google Scholar
  8. Saugata Basu, Richard Pollack, and Marie-Françoise Roy. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM, 43(6):1002-1045, 1996. URL: http://dx.doi.org/10.1145/235809.235813.
  9. Timothy M. Chan. Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom., 35(1-2):20-35, 2006. URL: http://dx.doi.org/10.1016/j.comgeo.2005.10.002.
  10. Timothy M. Chan. Dynamic coresets. Discrete & Computational Geometry, 42(3):469-488, 2009. URL: http://dx.doi.org/10.1007/s00454-009-9165-3.
  11. Gereon Frahling, Piotr Indyk, and Christian Sohler. Sampling in dynamic data streams and applications. Int. J. Comput. Geometry Appl., 18(1/2):3-28, 2008. URL: http://dx.doi.org/10.1142/S0218195908002520.
  12. Piotr Indyk. Algorithms for dynamic geometric problems over data streams. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 373-380, 2004. URL: http://dx.doi.org/10.1145/1007352.1007413.
  13. Yi Li, Huy L. Nguyen, and David P. Woodruff. Turnstile streaming algorithms might as well be linear sketches. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pages 174-183, 2014. URL: http://dx.doi.org/10.1145/2591796.2591812.
  14. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google Scholar
  15. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2005. Google Scholar
  16. Hamid Zarrabi-Zadeh. An almost space-optimal streaming algorithm for coresets in fixed dimensions. Algorithmica, 60(1):46-59, 2011. URL: http://dx.doi.org/10.1007/s00453-010-9392-2.
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail