An alternative proof for the equivalence of searcher and 2-searcher

DOI10.1016/j.tcs.2016.04.016zbMath1339.68270OpenAlexW2342108770MaRDI QIDQ284588

Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita

Publication date: 18 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.016

zbMATH Keywords

searcherequivalence2-searcherpolygon search

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers

Cites Work

• Unnamed Item
• Simple algorithms for searching a polygon with flashlights
• Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
• How to learn an unknown environment. I
• Searching for a Mobile Intruder in a Polygonal Region
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT

This page was built for publication: An alternative proof for the equivalence of searcher and 2-searcher