Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Finding the maximum bounded intersection of k out of n halfplanes
- Authors
- Brass, Peter; Na, Hyeon-Suk
- Issue Date
- 1-Jan-2010
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Computational geometry; Algorithms; Maximum intersection
- Citation
- INFORMATION PROCESSING LETTERS, v.110, no.3, pp.113 - 115
- Journal Title
- INFORMATION PROCESSING LETTERS
- Volume
- 110
- Number
- 3
- Start Page
- 113
- End Page
- 115
- ISSN
- 0020-0190
- Abstract
- In this note we study the following question: Given n halfplanes, find the maximum-area bounded intersection of k halfplanes out of them. We solve this problem in O(n(3)k) time and O(n(2)k) space. (C) 2009 Elsevier B All rights reserved
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Na, Hyeon-Suk
- College of Information Technology (School of Computer Science and Engineering)