제한된 직교 단조 다각형의 근사 최단 경로를 구하는 알고리즘An algorithm for competitive shortest path of restricted rectilinear monotone polygon

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 479
  • Download : 0
Advisors
좌경룡researcherChwa, Kyung-Yongresearcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1998
Identifier
134031/325007 / 000963444
Language
kor
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 1998.2, [ 39 p. ]

Keywords

제한된 직교 단조 다각형; 계산 기하학; 근사 최단 경로; Competitive shortest path; Restricted rectilinear monotone polygond; Computational geometry

URI
http://hdl.handle.net/10203/34277
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=134031&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0