Approximating extent measures of points.
From MaRDI portal
Publication:3069903
DOI10.1145/1008731.1008736zbMATH Open1204.68240OpenAlexW1981313592MaRDI QIDQ3069903FDOQ3069903
Authors: Pankaj K. Agarwal, Sariel Har-Peled, Kasturi 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
Recommendations
- Maintaining approximate extent measures of moving points
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Practical methods for shape fitting and kinetic data structures using core sets
- Practical methods for shape fitting and kinetic data structures using coresets
- Dynamic coresets
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (70)
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- \(k\)-median/means with outliers revisited: a simple fpt approximation
- Simplified Planar Coresets for Data Streams
- Title not available (Why is that?)
- Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
- Approximate convex hull of data streams
- Core-sets: updated survey
- Minimum-width double-slabs and widest empty slabs in high dimensions
- Streaming with minimum space: an algorithm for covering by two congruent balls
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Out-of-order event processing in kinetic data structures
- On the minimum-area rectangular and square annulus problem
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
- Dynamic coresets
- Practical methods for shape fitting and kinetic data structures using core sets
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- Practical methods for shape fitting and kinetic data structures using coresets
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Aligning two convex figures to minimize area or perimeter
- Kinetic facility location
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- Title not available (Why is that?)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Robust shape fitting via peeling and grating coresets
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Optimal consensus set for digital flake hyperspheres in \(n\)D
- Communication costs in a geometric communication network
- Approximate polytope membership queries
- Window queries for intersecting objects, maximal points and approximations using coresets
- Probabilistic \(k\)-median clustering in data streams
- Persistent homology for low-complexity models
- Economical Delone sets for approximating convex bodies
- Approximation algorithms for stochastic combinatorial optimization problems
- Single facility collection depots location problem in the plane
- Approximate convex intersection detection with applications to width and Minkowski sums
- Parameterized low-rank binary matrix approximation
- Parameterized \(k\)-clustering: tractability island
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
- A streaming algorithm for \(k\)-means with approximate coreset
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Maintaining approximate extent measures of moving points
- Uniformity of point samples in metric spaces using gap ratio
- Sparse Approximation via Generating Point Sets
- On the \(k\)-colored rainbow sets in fixed dimensions
- How to get close to the median shape
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Extremal point queries with lines and line segments and related problems
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Maximum matchings in geometric intersection graphs
- Learning big (image) data via coresets for dictionaries
- On the combinatorial complexity of approximating polytopes
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Parameterized low-rank binary matrix approximation
- Computing \(k\) centers over streaming data for small \(k\)
- Algorithms for ε-Approximations of Terrains
- Streaming algorithms for extent problems in high dimensions
- Approximating a planar convex set using a sparse grid
- A FAST k-MEANS IMPLEMENTATION USING CORESETS
- Approximation algorithms for color spanning diameter
- Computing a minimum-width square annulus in arbitrary orientation
- A family of unsupervised sampling algorithms
- Tree drawings revisited
- Tree drawings revisited
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
- Adaptive sampling for geometric problems over data streams
- GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
This page was built for publication: Approximating extent measures of points.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069903)
