@inproceedings{000641d3624e41cf975ecdcceee9baf8,

title = "The Aquarium Keeper's problem",

abstract = "We solve the problem of computing the shortest closed path inside a given polygon which visits every edge at least once (Aquarium Keeper's Tour). For convex polygons, we present a linear-time algorithm which uses the reflection principle and shortest-path maps. We then generalize that method by using relative convex hulls to provide a linear algorithm for polygons which are not convex.",

author = "Jurek Czyzowicz and Peter Egyed and Hazel Everett and David Rappaport and Thomas Shermer and Diane Souvaine and Godfried Toussaint and Jorge Urrutia",

year = "1991",

month = mar,

day = "1",

language = "English (US)",

isbn = "0897913760",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "459--464",

booktitle = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991",

note = "2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 ; Conference date: 28-01-1991 Through 30-01-1991",

}