An O\((n\log n)\) algorithm for the zoo-keeper's problem
type: Item
instance of: scholarly article
title: An O\((n\log n)\) algorithm for the zoo-keeper's problem
zbMATH Open document ID: 1013.68269
DOI: 10.1016/S0925-7721(02)00092-5
author: Sergei Bespamyatnikh
published in: Computational Geometry
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1902831
zbMATH Keywords: shortest paths
zbMATH Keywords: zoo-keeper's problem
zbMATH Keywords: floodlight tree
MaRDI profile type: Publication
cites work: Visibility and intersection problems in plane geometry
cites work: The zookeeper route problem
cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
cites work: Optimal shortest path queries in a simple polygon
cites work: A new data structure for shortest path queries in a simple polygon
cites work: Q5501793
cites work: Q3799261
cites work: Q4945523
description: scientific article; zbMATH DE number 1902831