The forest hiding problem

DOI10.1007/s00454-010-9261-4zbMath1213.52015OpenAlexW1978387225MaRDI QIDQ633206

Adrian Dumitrescu, Ming-Hui Jiang

Publication date: 31 March 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-010-9261-4

zbMATH Keywords

illuminationvisibility problemmaximal disk packing

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (1)

On visibility problems with an infinite discrete set of obstacles

Cites Work

• The orchard visibility problem and some variants
• Unsolved problems in geometry
• Intersection queries in sets of disks
• Intersection Queries in Curved Objects
• Polya's Orchard Problem
• Candle in the woods
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The forest hiding problem