Covering a set of line segments with a few squares

DOI10.1016/j.tcs.2022.04.053OpenAlexW3124323460MaRDI QIDQ5925557

André van Renssen, Sampson Wong, Lionov Wiratma, Frank Staals, Joachim Gudmundsson, Mees van de Kerkhof

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.09913

zbMATH Keywords

data structurescomputational geometrygeometric coverings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Fractional cascading. I: A data structuring technique
• Optimal packing and covering in the plane are NP-complete
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• Exact and approximation algorithms for clustering
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
• Optimizing squares covering a set of points
• On the Complexity of Some Common Geometric Location Problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On the rectangularp-center problem
• ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS
• Covering a set of line segments with a few squares

This page was built for publication: Covering a set of line segments with a few squares