The Aquarium Keeper's problem

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
PublisherAssociation for Computing Machinery
Pages459-464
Number of pages6
VolumePart F129903
ISBN (Print)0897913760
StatePublished - Mar 1 1991
Event2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 - San Francisco, United States
Duration: Jan 28 1991Jan 30 1991

Other

Other2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
CountryUnited States
CitySan Francisco
Period1/28/911/30/91

Fingerprint

Polygon
Reflection Principle
Linear Algorithm
Convex polygon
Linear-time Algorithm
Convex Hull
Shortest path
Closed
Path
Generalise
Computing

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Czyzowicz, J., Egyed, P., Everett, H., Rappaport, D., Shermer, T., Souvaine, D., ... Urrutia, J. (1991). The Aquarium Keeper's problem. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 (Vol. Part F129903, pp. 459-464). Association for Computing Machinery.

The Aquarium Keeper's problem. / Czyzowicz, Jurek; Egyed, Peter; Everett, Hazel; Rappaport, David; Shermer, Thomas; Souvaine, Diane; Toussaint, Godfried; Urrutia, Jorge.

Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Vol. Part F129903 Association for Computing Machinery, 1991. p. 459-464.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Czyzowicz, J, Egyed, P, Everett, H, Rappaport, D, Shermer, T, Souvaine, D, Toussaint, G & Urrutia, J 1991, The Aquarium Keeper's problem. in Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. vol. Part F129903, Association for Computing Machinery, pp. 459-464, 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991, San Francisco, United States, 1/28/91.
Czyzowicz J, Egyed P, Everett H, Rappaport D, Shermer T, Souvaine D et al. The Aquarium Keeper's problem. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Vol. Part F129903. Association for Computing Machinery. 1991. p. 459-464
Czyzowicz, Jurek ; Egyed, Peter ; Everett, Hazel ; Rappaport, David ; Shermer, Thomas ; Souvaine, Diane ; Toussaint, Godfried ; Urrutia, Jorge. / The Aquarium Keeper's problem. Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Vol. Part F129903 Association for Computing Machinery, 1991. pp. 459-464
@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 = "3",
day = "1",
language = "English (US)",
isbn = "0897913760",
volume = "Part F129903",
pages = "459--464",
booktitle = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - The Aquarium Keeper's problem

AU - Czyzowicz, Jurek

AU - Egyed, Peter

AU - Everett, Hazel

AU - Rappaport, David

AU - Shermer, Thomas

AU - Souvaine, Diane

AU - Toussaint, Godfried

AU - Urrutia, Jorge

PY - 1991/3/1

Y1 - 1991/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85032002331&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032002331&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85032002331

SN - 0897913760

VL - Part F129903

SP - 459

EP - 464

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

PB - Association for Computing Machinery

ER -