Square and Rectangle Covering with Outliers

DOI10.1007/978-3-642-02270-8_15zbMath1248.68516OpenAlexW1922326618MaRDI QIDQ5321703

Wanbin Son, Hee-Kap Ahn, Sang-Sub Kim, Iris Reinbacher, Sang Won Bae, Matias Korman

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Enclosing \(k\) points in the smallest axis parallel rectangle
• Covering a set of points by two axis-parallel boxes
• Algorithms for optimal outlier removal
• Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
• Geometric applications of a randomized optimization technique
• Lower bounds for covering problems
• Discrete rectilinear 2-center problems
• Finding k points with minimum diameter and related problems
• Covering a Point Set by Two Disjoint Rectangles

This page was built for publication: Square and Rectangle Covering with Outliers