SCOPUS 정보 검색 플랫폼

Volumn 87, Issue 4, 2003, Pages 179-186

Finding shortest safari routes in simple polygons

Author keywords

Adjustments; Computational geometry; Safari routes; Zookeeper's routes

Indexed keywords

ALGORITHMS; MATHEMATICAL PROGRAMMING; SET THEORY;

SAFARI ROUTES;

COMPUTATIONAL METHODS;

EID: 0041669404 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(03)00284-9 Document Type: Article

Times cited : (26)

References (12)

1
- 51249179364
- Triangulating a simple polygon in linear time
- Chazelle B. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6:1991;485-524.
- (1991) Discrete Comput. Geom. , vol.6 , pp. 485-524
- Chazelle, B.¹

2
- 0024012683
- Optimum watchman routes
- Chin W.P., Ntafos S. Optimum watchman routes. Inform. Process. Lett. 28:1988;39-44.
- (1988) Inform. Process. Lett. , vol.28 , pp. 39-44
- Chin, W.P.¹ Ntafos, S.²

3
- 51249174989
- Shortest watchman routes in simple polygons
- Chin W.P., Ntafos S. Shortest watchman routes in simple polygons. Discrete Comput. Geom. 6:1991;9-31.
- (1991) Discrete Comput. Geom. , vol.6 , pp. 9-31
- Chin, W.P.¹ Ntafos, S.²

4
- 44049109902
- The zookeeper route problem
- Chin W.P., Ntafos S. The zookeeper route problem. Inform. Sci. 63:1992;245-259.
- (1992) Inform. Sci. , vol.63 , pp. 245-259
- Chin, W.P.¹ Ntafos, S.²

5
- 85032002331
- The aquarium keeper's problem
- Czyzowicz J., Egyed P., Everett H., Rappaport D., Shermer T., Souvaine D., Toussaint G., Urrutia J. The aquarium keeper's problem. Proc. 2nd ACM-SIAM Symp. Discrete Algorithms. 1991;459-464.
- (1991) Proc. 2nd ACM-SIAM Symp. Discrete Algorithms , pp. 459-464
- Czyzowicz, J.¹ Egyed, P.² Everett, H.³ Rappaport, D.⁴ Shermer, T.⁵ Souvaine, D.⁶ Toussaint, G.⁷ Urrutia, J.⁸

6
- 0023247608
- Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons
- Guibas L., Hershberger J., Leven D., Sharir M., Tarjan R. Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons. Algorithmica. 2:1987;209-233.
- (1987) Algorithmica , vol.2 , pp. 209-233
- Guibas, L.¹ Hershberger, J.² Leven, D.³ Sharir, M.⁴ Tarjan, R.⁵

7
- 0038045700
- An efficient solution to the zookeeper's problem
- Hershberger J., Snoeyink J. An efficient solution to the zookeeper's problem. Proc. 6th Canadian Conf. on Comput. Geom. 1994;104-109.
- (1994) Proc. 6th Canadian Conf. on Comput. Geom. , pp. 104-109
- Hershberger, J.¹ Snoeyink, J.²

9
- 0001260940
- Watchman routes under limited visibility
- Ntafos S. Watchman routes under limited visibility. Comput. Geom. Theory Appl. 1:1992;149-170.
- (1992) Comput. Geom. Theory Appl. , vol.1 , pp. 149-170
- Ntafos, S.¹

10
- 0039208730
- An incremental algorithm for constructing shortest watchman routes
- Tan X., Hirata T., Inagaki Y. An incremental algorithm for constructing shortest watchman routes. Internat. J. Comput. Geom. Appl. 3:1993;351-365.
- (1993) Internat. J. Comput. Geom. Appl. , vol.3 , pp. 351-365
- Tan, X.¹ Hirata, T.² Inagaki, Y.³

11
- 0001266603
- Corrigendum to "an incremental algorithm for constructing shortest watchman routes"
- Tan X., Hirata T., Inagaki Y. Corrigendum to "An incremental algorithm for constructing shortest watchman routes" Internat. J. Comput. Geom. Appl. 9:1999;319-323.
- (1999) Internat. J. Comput. Geom. Appl. , vol.9 , pp. 319-323
- Tan, X.¹ Hirata, T.² Inagaki, Y.³

12
- 0035155541
- Fast computation of shortest watchman routes in simple polygons
- Tan X. Fast computation of shortest watchman routes in simple polygons. Inform. Process. Lett. 77:2001;27-33.
- (2001) Inform. Process. Lett. , vol.77 , pp. 27-33
- Tan, X.¹

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