Shortest zookeeper's routes in simple polygons

DOI10.1016/S0020-0190(00)00144-7zbMath1003.68175OpenAlexW2064191526MaRDI QIDQ1607077

Xue-Hou Tan

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00144-7

zbMATH Keywords

zookeeper's route problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

A 2-approximation algorithm for the zookeeper's problem ⋮ Approximation algorithms for the watchman route and zookeeper's problems. ⋮ An approximative solution to the Zookeeper's problem ⋮ The traveling salesmanpProblem for lines in the plane

Cites Work

• Maintaining visibility of a polygon with a moving point of view
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A new data structure for shortest path queries in a simple polygon
• The zookeeper route problem

This page was built for publication: Shortest zookeeper's routes in simple polygons