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

DOI10.1016/J.IPL.2004.06.010zbMATH Open1173.68471OpenAlexW2048236631MaRDI QIDQ834883FDOQ834883

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 geometrypolygon searchart gallery problemsearch numberguard setsearchlight problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Searching for a Mobile Intruder in a Polygonal Region
• 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 mobile intruders in a polygonal region by a group of mobile searchers
• THE TWO GUARDS PROBLEM
• The Searchlight Scheduling Problem
• An algorithm for searching a polygonal region with a flashlight

Cited In (6)

• An annotated bibliography on guaranteed graph searching
• SEARCHING POLYHEDRA BY ROTATING HALF-PLANES
• The searchlight problem for road networks
• A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING
• Searching a Polygonal Region by Two Guards
• Combinatorial Geometry and Graph Theory

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)