The orchard visibility problem and some variants

DOI10.1016/j.jcss.2007.06.004zbMath1140.52302OpenAlexW2002572669MaRDI QIDQ927876

Clyde P. Kruskal

Publication date: 10 June 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.06.004

zbMATH Keywords

orchardorchard visibility

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (4)

Tail asymptotics of free path lengths for the periodic Lorentz process: on Dettmann's geometric conjectures ⋮ The forest hiding problem ⋮ On visibility problems with an infinite discrete set of obstacles ⋮ Rational approximation and arithmetic progressions

Cites Work

• Polya's Orchard Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The orchard visibility problem and some variants