Point Covering

Given a set of $n$ halfplanes and a number $k$ , determine whether there is a point $p$ that is covered by at least $k$ of the halfplanes.

Parameters

$n$ : number of halfplanes

Related Problems

Strips Cover Box

Triangles Cover Triangle

Hole in Union

Triangle Measure

Point Covering

Max Depth

Smallest k-Enclosing Rectangle

Min-Weight k-Enclosing Rectangle

Closest-Weight k-Enclosing Rectangle

Max-Weight Rectangle

Weighted Depth

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table