A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Pursuit Evasion on Polyhedral Surfaces
2015
Algorithmica
We consider the following variant of a classical pursuit-evasion problem: how many pursuers are needed to capture a single (adversarial) evader on a closed polyhedral surface in three dimensions? The players move on the polyhedral surface, have the same maximum speed, and are always aware of each others' current positions. This generalizes the classical lion-and-the-man game, originally proposed by Rado (Littlewood in Littlewood?s miscellany, Cambridge University Press 1986), in which the
doi:10.1007/s00453-015-9988-7
fatcat:r43ejmo3frchhgcrrl64ux2r3y