Covering a Point Set by Two Disjoint Rectangles

DOI10.1007/978-3-540-92182-0_64zbMATH Open1183.68649OpenAlexW2100599306MaRDI QIDQ3596765FDOQ3596765

Authors: Hee-Kap Ahn, Sang Won Bae 

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_64

Recommendations

• Covering a point set by two disjoint rectangles
• Square and Rectangle Covering with Outliers
• Covering a set of points in a plane using two parallel rectangles
• Covering point sets with two disjoint disks or squares
• Discrete rectilinear 2-center problems

Mathematics Subject Classification ID

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

Cited In (10)

• Optimizing squares covering a set of points
• Covering point sets with two disjoint disks or squares
• Covering a set of points by two axis-parallel boxes
• Title not available (Why is that?)
• Enclosing a Set of Objects by Two Minimum Area Rectangles
• Covering a set of points in a plane using two parallel rectangles
• Covering a point set by two disjoint rectangles
• Square and Rectangle Covering with Outliers
• Lower bounds for covering problems
• Covering points by disjoint boxes with outliers

This page was built for publication: Covering a Point Set by Two Disjoint Rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596765)