dc.citation.conferencePlace |
CC |
- |
dc.citation.conferencePlace |
Guilin |
- |
dc.citation.endPage |
149 |
- |
dc.citation.startPage |
142 |
- |
dc.citation.title |
7th Annual International Conference on Computing and Combinatorics, COCOON 2001 |
- |
dc.contributor.author |
Bose, Prosenjit |
- |
dc.contributor.author |
Morin, Pat |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-20T06:35:53Z |
- |
dc.date.available |
2023-12-20T06:35:53Z |
- |
dc.date.created |
2016-07-04 |
- |
dc.date.issued |
2001-08-20 |
- |
dc.description.abstract |
We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained in P, and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on worst case input, is O(n log n). This is optimal in the algebraic decision tree model of computation. |
- |
dc.identifier.bibliographicCitation |
7th Annual International Conference on Computing and Combinatorics, COCOON 2001, pp.142 - 149 |
- |
dc.identifier.doi |
10.1007/3-540-44679-6_16 |
- |
dc.identifier.issn |
0302-9743 |
- |
dc.identifier.scopusid |
2-s2.0-84944096670 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34498 |
- |
dc.identifier.url |
http://link.springer.com/chapter/10.1007/3-540-44679-6_16 |
- |
dc.language |
영어 |
- |
dc.publisher |
7th Annual International Conference on Computing and Combinatorics, COCOON 2001 |
- |
dc.title |
Packing Two Disks into a Polygonal Environment |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2001-08-20 |
- |