Competitive searching in a generalized street

DOI10.1016/S0925-7721(99)00015-2zbMath0944.68044OpenAlexW2217504651MaRDI QIDQ1807650

Christian Icking, Amitava Datta

Publication date: 23 November 1999

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00015-2

zbMATH Keywords

doublingstreet

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (5)

Online algorithms for searching and exploration in the plane ⋮ The ultimate strategy to search on \(m\) rays? ⋮ On-line path planning in an unknown polygonal environment ⋮ Parallel searching on \(m\) rays ⋮ LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS

This page was built for publication: Competitive searching in a generalized street