Thesis
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 정다혜 | - |
| dc.date.accessioned | 2023-04-07T16:34:43Z | - |
| dc.date.available | 2023-04-07T16:34:43Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.other | OAK-2015-09843 | - |
| dc.identifier.uri | http://postech.dcollection.net/common/orgView/200000597858 | ko_KR |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/117297 | - |
| dc.description | Master | - |
| dc.description.abstract | In this thesis, we consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, fi nd two congruent disks of minimum radius whose union contains the polygon. For a convex polygon P with n vertices, we present an O(n log n)-time algorithm for the two-center problem for P. This improves upon the previously best known algorithm for the problem. | - |
| dc.language | eng | - |
| dc.publisher | 포항공과대학교 | - |
| dc.title | The Two-Center Problem for Convex Polygons | - |
| dc.title.alternative | 볼록 다각형의 2-중심 문제 | - |
| dc.type | Thesis | - |
| dc.contributor.college | 컴퓨터공학과 | - |
| dc.date.degree | 2022- 2 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.