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
Packing two disks into a polygonal environment
- Author(s)
- Bose, Prosenjit, Morin, Pat, Vigneron, Antoine
- Issued Date
- 2004-09
- Citation
- JOURNAL OF DISCRETE ALGORITHMS, v.2, no.3, pp.373 - 380
- 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.
- Publisher
- Elsevier BV
- ISSN
- 1570-8667
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.