File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Vigneron, Antoine
- Geometric Algorithms Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.endPage | 380 | - |
| dc.citation.number | 3 | - |
| dc.citation.startPage | 373 | - |
| dc.citation.title | JOURNAL OF DISCRETE ALGORITHMS | - |
| dc.citation.volume | 2 | - |
| dc.contributor.author | Bose, Prosenjit | - |
| dc.contributor.author | Morin, Pat | - |
| dc.contributor.author | Vigneron, Antoine | - |
| dc.date.accessioned | 2023-12-22T10:43:00Z | - |
| dc.date.available | 2023-12-22T10:43:00Z | - |
| dc.date.created | 2016-06-18 | - |
| dc.date.issued | 2004-09 | - |
| 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 any input, is O(nlogn). This is optimal in the algebraic decision tree model of computation. | - |
| dc.identifier.bibliographicCitation | JOURNAL OF DISCRETE ALGORITHMS, v.2, no.3, pp.373 - 380 | - |
| dc.identifier.doi | 10.1016/j.jda.2003.12.003 | - |
| dc.identifier.issn | 1570-8667 | - |
| dc.identifier.scopusid | 2-s2.0-10644263691 | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19956 | - |
| dc.identifier.url | http://www.sciencedirect.com/science/article/pii/S157086670300087X | - |
| dc.language | 영어 | - |
| dc.publisher | Elsevier BV | - |
| dc.title | Packing two disks into a polygonal environment | - |
| dc.type | Article | - |
| dc.description.journalRegisteredClass | scopus | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.