On covering orthogonal polygons with star-shaped polygons

DOI10.1016/0020-0255(92)90077-LzbMath0792.68187MaRDI QIDQ1193845

Laxmi P. Gewali, Mark J. Keil, Simeon C. Ntafos

Publication date: 27 September 1992

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

star-shaped polygonshorizontally convex orthogonal polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Covering grids and orthogonal polygons with periscope guards ⋮ Note on covering monotone orthogonal polygons with star-shaped polygons ⋮ Minimum r-Star Cover of Class-3 Orthogonal Polygons ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ Star-Shaped and L-Shaped Orthogonal Drawings ⋮ LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM ⋮ Corrigendum to ``Note on covering monotone orthogonal polygons ⋮ Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem

Cites Work

• Unnamed Item
• Unnamed Item
• An alternative proof of the rectilinear art gallery theorem
• Traditional Galleries Require Fewer Watchmen
• Decomposing a Polygon into Simpler Components
• Computational complexity of art gallery problems
• On rectangular visibility
• Some NP-hard polygon decomposition problems
• A simple proof of the rectilinear art gallery theorem

This page was built for publication: On covering orthogonal polygons with star-shaped polygons