Covering and guarding polygons using \(L_ k\)-sets

DOI10.1007/BF00147413zbMath0721.52005OpenAlexW2060555366MaRDI QIDQ2640882

Thomas C. Shermer

Publication date: 1991

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00147413

zbMATH Keywords

triangulationvisibilitylink distanceguards\(L_ k\)-convex

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Generalized guarding and partitioning for rectilinear polygons ⋮ On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Total domination in plane triangulations ⋮ Distance domination, guarding and covering of maximal outerplanar graphs ⋮ Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs

This page was built for publication: Covering and guarding polygons using \(L_ k\)-sets