Algorithms for optimal outlier removal
From MaRDI portal
Publication:1026234
DOI10.1016/j.jda.2008.12.002zbMath1184.68555OpenAlexW2156148354MaRDI QIDQ1026234
Rossen Atanassov, Mathieu Couture, Stefanie Wuhrer, Anil Maheshwari, Prosenjit Bose, Michel Paquette, Pat Morin, Michiel H. M. Smid
Publication date: 24 June 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.12.002
General topics of discrete mathematics in relation to computer science (68R01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Expected size of random Tukey layers and convex layers ⋮ Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ Computing a minimum-width square or rectangular annulus with outliers ⋮ Cause I'm a genial imprecise point: outlier detection for uncertain data ⋮ On the \(k\)-colored rainbow sets in fixed dimensions ⋮ Square and Rectangle Covering with Outliers ⋮ Covering points by disjoint boxes with outliers ⋮ Fitting a Step Function to a Point Set ⋮ Fitting a step function to a point set ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Computing a Minimum-Width Square or Rectangular Annulus with Outliers ⋮ Smallest k-enclosing rectangle revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enclosing \(k\) points in the smallest axis parallel rectangle
- Finding minimum area \(k\)-gons
- Applications of a semi-dynamic convex hull algorithm
- Iterated nearest neighbors and finding minimal polytopes
- On geometric optimization with few violated constraints
- Vertex Cover: Further Observations and Further Improvements
- Finding k points with minimum diameter and related problems
- On the convex layers of a planar set
- Low-Dimensional Linear Programming with Violations
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
