Shortest zookeeper's routes in simple polygons

DOI10.1016/S0020-0190(00)00144-7MaRDI QIDQ1607077zbMATH OpenOpenAlexFDO

Authors Xuehou 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)

Recommendations

• A 2-approximation algorithm for the zookeeper's problem
• scientific article; zbMATH DE number 140109
• scientific article; zbMATH DE number 1555972
• scientific article; zbMATH DE number 4066651
• An approximative solution to the Zookeeper's problem

Cites work

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

Cited in

(9)

• The traveling salesmanpProblem for lines in the plane
• scientific article; zbMATH DE number 1555972 (Why is no real title available?)
• scientific article; zbMATH DE number 4066651 (Why is no real title available?)
• An O\((n\log n)\) algorithm for the zoo-keeper's problem
• Approximation algorithms for the watchman route and zookeeper's problems.
• The zookeeper route problem
• scientific article; zbMATH DE number 140109 (Why is no real title available?)
• A 2-approximation algorithm for the zookeeper's problem
• An approximative solution to the Zookeeper's problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607077)