Given a simple polygon P with n vertices and a starting point s on its boundary, the watchman route problem asks for a shortest route in P through s such that each point in the interior of the polygon can be seen from at least one point along the route. In this paper, we present a simple, linear-tim
The zookeeper route problem
β Scribed by Chin Wei-Pang; Simeon Ntafos
- Book ID
- 103105533
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 985 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Consider a simple polygon P containing disjoint convex polygons each of which shares an edge with P . The Zookeeper's Problem then asks for the shortest route in P that visits all convex polygons without entering their interiors. Existing algorithms that solve this problem run in time super-linear i
**The stars gave her a mate... and a rhino.** Tilly doesn't believe in aliens. At least, she didn't, until she gets abducted along with half the animals of her zoo. When you and your rhino are stuck in a cage on a spaceship, it's hard not to believe. One of them, an elf-eared female, seems ready
**Two women. One shocking wartime secret. And a family mystery just waiting to be discoveredβ¦** **Berlin Zoo, 1943:** **Ten-year-old Adelaide** and her newborn sister are orphaned after a devastating night of bombing. Heartbroken and frightened, Adelaide runs to her motherβs closest friend, **Kathar