Searching a polygonal region by a group of stationary \(k\)-searchers

DOI10.1016/j.ipl.2004.06.010zbMath1173.68471OpenAlexW2048236631MaRDI QIDQ834883

Ichiro Suzuki, Masafumi Yamashita, Tiko Kameda

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.010

zbMATH Keywords

computational geometryart gallery problempolygon searchsearch numberguard setsearchlight problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (4)

SEARCHING POLYHEDRA BY ROTATING HALF-PLANES ⋮ An annotated bibliography on guaranteed graph searching ⋮ A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING ⋮ The searchlight problem for road networks

Cites Work

• Unnamed Item
• Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
• The Searchlight Scheduling Problem
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• An algorithm for searching a polygonal region with a flashlight
• Searching for mobile intruders in a polygonal region by a group of mobile searchers

This page was built for publication: Searching a polygonal region by a group of stationary \(k\)-searchers