Robust shape fitting via peeling and grating coresets
From MaRDI portal
Publication:5920504
DOI10.1007/s00454-007-9013-2zbMath1138.68055MaRDI QIDQ5920504
Sariel Har-Peled, Hai Yu, Pankaj K. Agarwal
Publication date: 16 April 2008
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-007-9013-2
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
Related Items
FITTING FLATS TO POINTS WITH OUTLIERS, Unnamed Item, An almost space-optimal streaming algorithm for coresets in fixed dimensions, Dynamic coresets, Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Practical methods for shape fitting and kinetic data structures using coresets
- Halfspace range search: An algorithmic application of k-sets
- The power of geometric duality
- Cutting hyperplanes for divide-and-conquer
- Approximation algorithms for minimum-width annuli and shells
- Efficient searching with linear constraints
- On geometric optimization with few violated constraints
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
- Approximating extent measures of points
- Approximate Levels in Line Arrangements
- A space-optimal data-stream algorithm for coresets in the plane
- On k-Hulls and Related Problems
- Data Structures for Mobile Data
- Shape Fitting with Outliers
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Low-Dimensional Linear Programming with Violations
- Exact and approximation algorithms for minimum-width cylindrical shells
- Maintaining the extent of a moving point set
