An O\((n\log n)\) algorithm for the zoo-keeper's problem
From MaRDI portal
Publication:1869741
DOI10.1016/S0925-7721(02)00092-5zbMath1013.68269MaRDI QIDQ1869741
Publication date: 28 April 2003
Published in: Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
A 2-approximation algorithm for the zookeeper's problem, An approximative solution to the Zookeeper's problem
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