Finding the maximum bounded intersection of k out of n halfplanes

Authors:
Peter Brass;Hyeon-Suk Na
Affiliations:
Department of Computer Science, City College, New York, NY, USA;School of Computing, Soongsil University, Seoul, Republic of Korea
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

Finding extremal polygons

SIAM Journal on Computing
An optimal algorithm for finding minimal enclosing triangles

Journal of Algorithms
Computing a minimum weight k-link path in graphs with the concave Monge property

Journal of Algorithms - Special issue on SODA '95 papers
On a general method for maximizing and minimizing among certain geometric problems

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

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^3k) time and O(n^2k) space.