SCOPUS 정보 검색 플랫폼

Volumn 24, Issue 2, 2003, Pages 63-74

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

Author keywords

Floodlight tree; Shortest paths; Zoo keeper's problem

Indexed keywords

EID: 84867964405 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/S0925-7721(02)00092-5 Document Type: Article

Times cited : (14)

References (13)

1
- 0347108150
- Visibility and intersection problems in plane geometry
- B. Chazelle, and L.J. Guibas Visibility and intersection problems in plane geometry Discrete Comput. Geom. 4 1989 551 581
- (1989) Discrete Comput. Geom. , vol.4 , pp. 551-581
- Chazelle, B.¹ Guibas, L.J.²

2
- 44049109902
- The zoo-keeper route problem
- W. Chin, and S. Ntafos The zoo-keeper route problem Inform. Sci. 63 1992 245 259
- (1992) Inform. Sci. , vol.63 , pp. 245-259
- Chin, W.¹ Ntafos, S.²

3
- 0004634724
- Report F59, Inst. Informationsverarb., Tech. Univ. Graz, Graz, Austria
- H. Edelsbrunner, Dynamic data structures for orthogonal intersection queries, Report F59, Inst. Informationsverarb., Tech. Univ. Graz, Graz, Austria, 1980
- (1980) Dynamic Data Structures for Orthogonal Intersection Queries
- Edelsbrunner, H.¹

4
- 0025214884
- Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms
- H. Edelsbrunner, and E.P. Mücke Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms ACM Trans. Graph. 9 1 1990 66 104
- (1990) ACM Trans. Graph. , vol.9 , Issue.1 , pp. 66-104
- Edelsbrunner, H.¹ Mücke, E.P.²

5
- 0001586310
- Optimal shortest path queries in a simple polygon
- L.J. Guibas, and J. Hershberger Optimal shortest path queries in a simple polygon J. Comput. Syst. Sci. 39 2 1989 126 152
- (1989) J. Comput. Syst. Sci. , vol.39 , Issue.2 , pp. 126-152
- Guibas, L.J.¹ Hershberger, J.²

6
- 0026173270
- A new data structure for shortest path queries in a simple polygon
- J. Hershberger A new data structure for shortest path queries in a simple polygon Inform. Process. Lett. 38 1991 231 235
- (1991) Inform. Process. Lett. , vol.38 , pp. 231-235
- Hershberger, J.¹

7
- 0038045700
- An efficient solution to the zoo-keeper's problem
- J. Hershberger, and J. Snoeyink An efficient solution to the zoo-keeper's problem Proc. 6th Canad. Conf. Comput. Geom. 1994 104 109
- (1994) Proc. 6th Canad. Conf. Comput. Geom. , pp. 104-109
- Hershberger, J.¹ Snoeyink, J.²

8
- 0030782578
- A competitive strategy for learning a polygon
- F. Hoffmann, C. Icking, R. Klein, and K. Kriegel A competitive strategy for learning a polygon Proc. 8th ACM-SIAM Sympos. Discrete Algorithms 1997 166 174
- (1997) Proc. 8th ACM-SIAM Sympos. Discrete Algorithms , pp. 166-174
- Hoffmann, F.¹ Icking, C.² Klein, R.³ Kriegel, K.⁴

9
- 84944063678
- On the zookeeper's problem
- H. Jonsson On the zookeeper's problem Proc. 15th Europ. Workshop on Comput. Geom. 1999 141 144
- (1999) Proc. 15th Europ. Workshop on Comput. Geom. , pp. 141-144
- Jonsson, H.¹

10
- 0038531207
- Report CSL-80-9, Xerox Palo Alto Res. Center, Palo Alto, CA
- E.M. McCreight, Efficient algorithms for enumerating intersecting intervals and rectangles, Report CSL-80-9, Xerox Palo Alto Res. Center, Palo Alto, CA, 1980
- (1980) Efficient Algorithms for Enumerating Intersecting Intervals and Rectangles
- McCreight, E.M.¹

11
- 0003862832
- The International Series of Monographs on Computer Science Oxford University Press New York
- J. O'Rourke Art Gallery Theorems and Algorithms The International Series of Monographs on Computer Science 1987 Oxford University Press New York
- (1987) Art Gallery Theorems and Algorithms
- O'Rourke, J.¹

12
- 0026923143
- Recent results in art galleries
- T.C. Shermer Recent results in art galleries Proc. IEEE 80 9 1992 1384 1399
- (1992) Proc. IEEE , vol.80 , Issue.9 , pp. 1384-1399
- Shermer, T.C.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.