Covering Points with Rectangular Boundaries

arXiv:2607.08183 · cs.CG · Submitted 2026-07-09 · Read on arXiv

cs.CG

Submitted: 2026-07-09

Updated: 2026-07-23

Terminology

• NP-hardness — 10× in this paper · explained in 3 episodes
• Editor — 7× in this paper · explained in 2 episodes
• L-Shape Cover — 6× in this paper
• Boundary Covering with Discrete Axis-Parallel Rectangles — 5× in this paper
• Consistency — 5× in this paper · explained in 3 episodes
• Constrained Bipartite Vertex Cover — 4× in this paper
• Boundary Covering with Continuous Axis-Parallel Lshapes — 1× in this paper
• Boundary Covering with Continuous Axis-Parallel Rectangles — 1× in this paper
• Clarity — 1× in this paper · explained in 3 episodes
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes

Related papers

• Strong Lower Bounds for Weak Epsilon-Nets
• Uniform Capacitated Clustering with Few Extra Centers
• Witnessed Boolean Contracts: Sound Local Distance Guarantees for Approximate Implicit CSG
• Certified Small Well-Separated Pair Decompositions in Practice
• Quantifying displacement: an urban expansion consequence via persistent homology
• All-even sets in R squared and R cubed