Abstract Chapter 51 The Aquarium Keeper’s Problem* (2009)
Jurek Czyzowiczt, Peter Egyed, Hazel Everew, Thomas Sherrnert, Diane Souvainell, Godfried Toussaint, ...
We solve the problem of computing the shortest closed path inside a given polygon which visits every edge at least once (Aquarium Z{eeper’s Tour). For convex polygons, we present a linear-time...