An O\((n\log n)\) algorithm for the zoo-keeper's problem

DOI10.1016/S0925-7721(02)00092-5zbMath1013.68269MaRDI QIDQ1869741

Sergei Bespamyatnikh

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

shortest pathsfloodlight treezoo-keeper's 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 ⋮ Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems ⋮ An approximative solution to the Zookeeper's problem ⋮ Optimal placement of base stations in border surveillance using limited capacity drones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Visibility and intersection problems in plane geometry
• A new data structure for shortest path queries in a simple polygon
• The zookeeper route problem
• Optimal shortest path queries in a simple polygon
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

This page was built for publication: An O\((n\log n)\) algorithm for the zoo-keeper's problem