Finding the maximum bounded intersection of k out of n halfplanes

https://doi.org/10.1016/j.ipl.2009.11.003Get rights and content

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.

References (8)

There are more references available in the full text version of this article.

Cited by (0)

1

Supported by Korean Research Foundation Grant (KRF-2007-531-D00018).

View full text