Algorithms for optimal outlier removal

DOI10.1016/j.jda.2008.12.002zbMath1184.68555MaRDI QIDQ1026234

Anil Maheshwari, Prosenjit Bose, Pat Morin, Mathieu Couture, Michiel H. M. Smid, Stefanie Wuhrer, Rossen Atanassov, Michel Paquette

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

zbMATH Keywords

computational geometry; computational statistics; outlier removal

Mathematics Subject Classification ID

68R01: General topics of discrete mathematics in relation to computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Square and Rectangle Covering with Outliers, Fitting a step function to a point set, Covering points by disjoint boxes with outliers, Fitting a Step Function to a Point Set

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