Multiple-guard kernels of simple polygons

DOI10.1007/BF01225680zbMath1005.52001OpenAlexW2016863924MaRDI QIDQ1818909

Sven Schuierer, Derick 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

two-kernelsimple polygon

Mathematics Subject Classification ID

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

Related Items (2)

Starshaped sets ⋮ Optimizing generalized kernels of polygons

Cites Work

• Unnamed Item
• Computing the geodesic center of a simple polygon
• Critical visibility and outward rays
• A short proof of Chvatal's Watchman Theorem
• An efficient algorithm for guard placement in polygons with holes
• A combinatorial theorem in plane geometry
• Computational complexity of art gallery problems
• Clear Visibility and the Dimension of Kernels of Starshaped Sets

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