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
- 2001-08-20
- Citation
- 7th Annual International Conference on Computing and Combinatorics, COCOON 2001, pp.142 - 149
- 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.
- Publisher
- 7th Annual International Conference on Computing and Combinatorics, COCOON 2001
- ISSN
- 0302-9743
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.