Approximating extent measures of points
From MaRDI portal
Publication:3069903
DOI10.1145/1008731.1008736zbMath1204.68240MaRDI QIDQ3069903
Sariel Har-Peled, Pankaj K. Agarwal, Kasturi R. Varadarajan
Publication date: 1 February 2011
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1008731.1008736
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
68W25: Approximation algorithms
Related Items
GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS, Analysis of incomplete data and an intrinsic-dimension Helly theorem, Robust shape fitting via peeling and grating coresets, Out-of-order event processing in kinetic data structures, An almost space-optimal streaming algorithm for coresets in fixed dimensions, An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width, Dynamic coresets, How to get close to the median shape, Kinetic facility location, Practical methods for shape fitting and kinetic data structures using coresets, Single facility collection depots location problem in the plane, Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric, Adaptive sampling for geometric problems over data streams, Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets, Extremal point queries with lines and line segments and related problems, Simplified Planar Coresets for Data Streams, SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS, An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions, A FAST k-MEANS IMPLEMENTATION USING CORESETS
