A linear-time heuristic for minimum rectangular coverings (Extended abstract)
From MaRDI portal
Publication:5055944
DOI10.1007/BFb0036193MaRDI QIDQ5055944
Joachim Gudmundsson, Christos Levcopoulos
Publication date: 9 December 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
- Some NP-hard polygon decomposition problems
- Covering Polygons Is Hard
- A linear-time heuristic for minimum rectangular coverings (Extended abstract)
