Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions

DOI10.1007/978-3-642-22300-6_17zbMath1342.68356OpenAlexW1650804014MaRDI QIDQ5199242

Vinayak Pathak, Timothy M. Chan

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

Streaming and dynamic algorithms for minimum enclosing balls in high dimensions ⋮ Streaming with minimum space: an algorithm for covering by two congruent balls ⋮ Streaming algorithms for extent problems in high dimensions

This page was built for publication: Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions