Online exploration outside a convex obstacle

DOI10.1016/j.tcs.2022.06.037OpenAlexW2871733270MaRDI QIDQ2166745

Slava Shamshanov, Reuven Cohen, Eitan Tiktinsky, Shai Gul

Publication date: 25 August 2022

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

Full work available at URL: https://arxiv.org/abs/1807.02773

zbMATH Keywords

convexityonline algorithmsspiral search

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Minimum-link watchman tours
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Search games
• Watchman routes under limited visibility
• On the complexity of locating linear facilities in the plane
• The Polygon Exploration Problem
• Online Exploration of Polygons with Holes
• Optimal Exploration of Terrains with Obstacles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online exploration outside a convex obstacle