Finding the maximum bounded intersection of k out of n halfplanes
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
computational geometry algorithms maximum intersection