scientific article; zbMATH DE number 1445396
From MaRDI portal
Publication:4952719
zbMath0953.65013MaRDI QIDQ4952719
David C. Lin, Joseph S. B. Mitchell, T. M. Murali, Sariel Har-Peled, Leonidas J. Guibas, Alon Efrat
Publication date: 29 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers, Sweeping simple polygons with the minimum number of chain guards, Studying the stochastic capturing of moving intruders by mobile sensors, Guarding Art Galleries: The Extra Cost for Sculptures Is Linear, Link distance and shortest path problems in the plane, Searching for mobile intruders in circular corridors by two 1-searchers, Optimum sweeps of simple polygons with two guards, Minimization of the maximum distance between the two guards patrolling a polygonal region, Mobile sensor intrusion detection under any shape of curve, Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem, Capture bounds for visibility-based pursuit evasion, Hide-and-Seek: Algorithms for Polygon Walk Problems, Escaping offline searchers and isoperimetric theorems, A unified and efficient solution to the room search problem, Minimum Time Multi-UGV Surveillance, An efficient algorithm for the three-guard problem, A property of random walks on a cycle graph, Link Distance and Shortest Path Problems in the Plane, Simple algorithms for searching a polygon with flashlights
