Finding the maximum bounded intersection of k out of n halfplanes |
| |
| Authors: | Peter Brass |
| |
| Affiliation: | a Department of Computer Science, City College, New York, NY, USA
b School of Computing, Soongsil University, Seoul, Republic of Korea |
| |
| 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(n3k) time and O(n2k) space. |
| |
| Keywords: | Computational geometry Algorithms Maximum intersection |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
