Covering polygons is even Harder

DOI10.1109/FOCS52979.2021.00045MaRDI QIDQ6943507zbMATH OpenFDO

Authors Mikkel Abrahamsen

Publication date 13 August 2025

Full work available at URL https://doi.org/10.1109/FOCS52979.2021.00045

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(7)

• Constructing concise convex covers via clique covers
• Minimum star partitions of simple polygons in polynomial time
• Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
• The maximum cover with rotating field of view
• Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete
• The complexity of recognizing geometric hypergraphs
• Covering simple orthogonal polygons with rectangles

This page was built for publication: Covering polygons is even Harder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943507)