An O(nlogn) algorithm for the zoo-keeper's problem-Reference-Cited by-同舟云学术

An O(nlogn) algorithm for the zoo-keeper's problem

Published:2003-02 Issue:2 Volume:24 Page:63-74
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Bespamyatnikh Sergei

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference13 articles.

1. Visibility and intersection problems in plane geometry;Chazelle;Discrete Comput. Geom.,1989

2. The zoo-keeper route problem;Chin;Inform. Sci.,1992

3. H. Edelsbrunner, Dynamic data structures for orthogonal intersection queries, Report F59, Inst. Informationsverarb., Tech. Univ. Graz, Graz, Austria, 1980

4. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms;Edelsbrunner;ACM Trans. Graph.,1990

5. Optimal shortest path queries in a simple polygon;Guibas;J. Comput. Syst. Sci.,1989

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal placement of base stations in border surveillance using limited capacity drones;Theoretical Computer Science;2022-09

2. The Touring Polygons Problem Revisited;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2018-05-01

3. Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems;Lecture Notes in Computer Science;2017

4. Visiting convex regions in a polygonal map;Robotics and Autonomous Systems;2013-10

5. Safari and Zookeeper Problems;Euclidean Shortest Paths;2011