Note on covering monotone orthogonal polygons with star-shaped polygons
From MaRDI portal
Publication:2380027
DOI10.1016/j.ipl.2007.06.015zbMath1187.68644MaRDI QIDQ2380027
Agnieszka Wasylewicz, Paweł Żyliński, Andrzej Lingas
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.06.015
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem, Corrigendum to ``Note on covering monotone orthogonal polygons, Minimum r-Star Cover of Class-3 Orthogonal Polygons, Star Shaped Orthogonal Drawing, Star-Shaped and L-Shaped Orthogonal Drawings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering orthogonal polygons with star polygons: The perfect graph approach
- On covering orthogonal polygons with star-shaped polygons
- Orthogonally convex covering of orthogonal polygons without holes
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Perfect Graphs and Orthogonally Convex Covers
- Some NP-hard polygon decomposition problems
- Covering Polygons Is Hard