Faster core-set constructions and data stream algorithms in fixed dimensions
From MaRDI portal
Publication:5361667
DOI10.1145/997817.997843zbMath1377.68322MaRDI QIDQ5361667
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/997817.997843
90C59: Approximation methods and heuristics in mathematical programming
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
Related Items
Efficiently approximating color-spanning balls, Minimum-volume enclosing ellipsoids and core sets, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Adaptive sampling for geometric problems over data streams, Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets