제한된 직교 단조 다각형의 근사 최단 경로를 구하는 알고리즘An algorithm for competitive shortest path of restricted rectilinear monotone polygon
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 좌경룡 | - |
| dc.contributor.advisor | Chwa, Kyung-Yong | - |
| dc.contributor.author | 이민규 | - |
| dc.contributor.author | Yi, Min-Kyu | - |
| dc.date.accessioned | 2011-12-13T05:59:04Z | - |
| dc.date.available | 2011-12-13T05:59:04Z | - |
| dc.date.issued | 1998 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=134031&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/34277 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1998.2, [ 39 p. ] | - |
| dc.language | kor | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | 제한된 직교 단조 다각형 | - |
| dc.subject | 계산 기하학 | - |
| dc.subject | 근사 최단 경로 | - |
| dc.subject | Competitive shortest path | - |
| dc.subject | Restricted rectilinear monotone polygond | - |
| dc.subject | Computational geometry | - |
| dc.title | 제한된 직교 단조 다각형의 근사 최단 경로를 구하는 알고리즘 | - |
| dc.title.alternative | An algorithm for competitive shortest path of restricted rectilinear monotone polygon | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 134031/325007 | - |
| dc.description.department | 한국과학기술원 : 전산학과, | - |
| dc.identifier.uid | 000963444 | - |
| dc.contributor.localauthor | 좌경룡 | - |
| dc.contributor.localauthor | Chwa, Kyung-Yong | - |
- Appears in Collection
- CS-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.