메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 1153-1158

An Efficient Strategy for Rapidly Finding an Object in a Polygonal World

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; PROBLEM SOLVING; SENSORS;

EID: 0348040456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (29)

References (14)
  • 9
    • 0022768932 scopus 로고
    • Shortest Paths in the Plane with Convex Polygonal Obstacles
    • Rohnert, H., "Shortest Paths in the Plane with Convex Polygonal Obstacles," Information Processing Letters, 23:71-76, 1986.
    • (1986) Information Processing Letters , vol.23 , pp. 71-76
    • Rohnert, H.1
  • 12
    • 0026923143 scopus 로고
    • Recent Results in Art Galleries
    • September
    • Shermer, T.C., "Recent Results in Art Galleries," Proc. of the IEEE, Vol. 80, issue 9, September 1992.
    • (1992) Proc. of the IEEE , vol.80 , Issue.9
    • Shermer, T.C.1
  • 14
    • 0002523327 scopus 로고
    • A Generic Solution to Polygon Clipping
    • July
    • Vatti, B.R., "A Generic Solution to Polygon Clipping," Communications of the ACM, 35(7), pp.56-63, July 1992.
    • (1992) Communications of the ACM , vol.35 , Issue.7 , pp. 56-63
    • Vatti, B.R.1


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