Covering a set of line segments with a few squares

DOI10.1007/978-3-030-75242-2_20OpenAlexW3164238344MaRDI QIDQ5925680

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

Publication date: 22 March 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_20

zbMATH Keywords

computational geometrytrajectory analysisgeometric coverings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Covering a set of line segments with a few squares

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On the rectangularp-center problem
• ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS

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