The prison yard problem

DOI10.1007/BF01212977zbMath0817.52010OpenAlexW2091895533WikidataQ61940278 ScholiaQ61940278MaRDI QIDQ1340137

Daniel J. Kleitman, Zoltan Fueredi

Publication date: 1 August 1995

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

triangulationpolygonconvexguard problems

Mathematics Subject Classification ID

Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (1)

Extension to 3-Colorable Triangulations

Cites Work

• Unnamed Item
• A combinatorial theorem in plane geometry
• Traditional Galleries Require Fewer Watchmen
• Computational complexity of art gallery problems

This page was built for publication: The prison yard problem