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...
Line transversal algorithms in the plane / (1992)
Written for the School of Computer Science.
Binay Bhattacharya, Peter Egyed, Ivan Stojmenovic, Jorge Urrutia
Given a family of objecte in the plane, the line transversal problem is to compute a line that intersects every member of the family. In this paper we examine a variation of the line transversal...