Generalized guarding and partitioning for rectilinear polygons

DOI10.1016/0925-7721(96)00014-4zbMath0849.68120OpenAlexW1983228657MaRDI QIDQ1917042

Thomas C. Shermer, Frank Hoffmann, Klaus Kriegel, Ervin Gyoeri

Publication date: 4 November 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://refubium.fu-berlin.de/handle/fub188/17794

zbMATH Keywords

visibilitypolygon decompositionrectilinear polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

FO model checking on geometric graphs ⋮ Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem ⋮ Generalized guarding and partitioning for rectilinear polygons ⋮ Mobile versus point guards ⋮ Approximation algorithms for art gallery problems in polygons ⋮ Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs ⋮ Edge guards in rectilinear polygons ⋮ Tight bounds for beacon-based coverage in simple rectilinear polygons

Cites Work

• An alternative proof of the rectilinear art gallery theorem
• Triangulating a simple polygon in linear time
• An efficient algorithm for guard placement in polygons with holes
• Generalized guarding and partitioning for rectilinear polygons
• Covering and guarding polygons using \(L_ k\)-sets
• Traditional Galleries Require Fewer Watchmen
• A Short Proof of the Rectilinear Art Gallery Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized guarding and partitioning for rectilinear polygons