Multiple-guard kernels of simple polygons

DOI10.1007/BF01225680MaRDI QIDQ1818909zbMATH OpenOpenAlexFDO

Authors Sven Schuierer, D. Wood

Publication date 24 February 2003

Published in Journal of Geometry (Search for Journal in Brave)

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

zbMATH Keywords

simple polygontwo-kernel

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• \(K\)-vertex guarding simple polygons
• Staircase two-guard kernels of orthogonal polygons
• Components of the kernel in a staircase starshaped polygon
• Note on the paper ``K-vertex guarding simple polygons
• Covering and guarding polygons using \(L_ k\)-sets

Cites work

• A combinatorial theorem in plane geometry
• A short proof of Chvatal's Watchman Theorem
• An efficient algorithm for guard placement in polygons with holes
• Clear Visibility and the Dimension of Kernels of Starshaped Sets
• Computational complexity of art gallery problems
• Computing the geodesic center of a simple polygon
• Critical visibility and outward rays
• scientific article; zbMATH DE number 4051002 (Why is no real title available?)

Cited in

(5)

• \(K\)-vertex guarding simple polygons
• Optimizing generalized kernels of polygons
• Starshaped sets
• A new algorithm for finding the kernel of a simple polygon
• Note on the paper ``K-vertex guarding simple polygons

This page was built for publication: Multiple-guard kernels of simple polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818909)