Minimum r-Star Cover of Class-3 Orthogonal Polygons

DOI10.1007/978-3-319-19315-1_25zbMath1401.68351OpenAlexW2285297852MaRDI QIDQ2946065

Leonidas Palios, Petros Tzimas

Publication date: 15 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_25

zbMATH Keywords

decompositioncovervisibilityorthogonal polygonoutput-sensitive\(r\)-star

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On orthogonally guarding orthogonal polygons with bounded treewidth

Cites Work

• 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
• Corrigendum to ``Note on covering monotone orthogonal polygons
• Note on covering monotone orthogonal polygons with star-shaped polygons
• Traditional Galleries Require Fewer Watchmen
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• Decomposing a Polygon into Simpler Components
• LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM

This page was built for publication: Minimum r-Star Cover of Class-3 Orthogonal Polygons