Searching a polygonal region by a group of stationary k-searchers

DOI10.1016/J.IPL.2004.06.010MaRDI QIDQ834883zbMATHzbMATHOpenAlexFDO

Authors Masafumi Yamashita, Ichiro Suzuki, 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 geometrypolygon searchart gallery problemsearch numberguard setsearchlight problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• Searching for a Mobile Intruder in a Polygonal Region
• scientific article; zbMATH DE number 2080272
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• Simple algorithms for searching a polygon with flashlights

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• An algorithm for searching a polygonal region with a flashlight
• Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Searching for a Mobile Intruder in a Polygonal Region
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• THE TWO GUARDS PROBLEM
• The Searchlight Scheduling Problem

Cited in

(8)

• Searching a Polygonal Region by Two Guards
• The searchlight problem for road networks
• scientific article; zbMATH DE number 2080272 (Why is no real title available?)
• Combinatorial Geometry and Graph Theory
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• A complete algorithm for searchlight scheduling
• An annotated bibliography on guaranteed graph searching
• Searching polyhedra by rotating half-planes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834883)