Optimizing Squares Covering a Set of Points

DOI10.1007/978-3-319-12691-3_4zbMath1431.68116OpenAlexW62054538MaRDI QIDQ2942380

Binay K. Bhattacharya, Priya Ranjan Sinha Mahapatra, Sandip Das, Zhao Song, Tsunehiko Kameda

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_4

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Related Items

Geometric p-Center Problems with Centers Constrained to Two Lines

Cites Work

• Covering point sets with two disjoint disks or squares
• Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
• On-line construction of the convex hull of a simple polyline
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
• Time bounds for selection
• Lower bounds for covering problems
• Discrete rectilinear 2-center problems
• COVERING A POINT SET BY TWO DISJOINT RECTANGLES
• Finding the smallest triangles containing a given convex polygon
• Finding minimal enclosing boxes
• An optimal algorithm for finding minimal enclosing triangles
• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES