Minimum-Weight Half-Plane Hitting Set

TL;DR

This paper introduces a more efficient algorithm for the minimum-weight half-plane hitting set problem, reducing the computational complexity from O(n^{7/2} log^2 n) to O(n^{5/2} log^2 n).

Contribution

The authors develop a novel algorithm that improves the runtime for solving the minimum-weight half-plane hitting set problem in the plane.

Findings

Reduced algorithm runtime from O(n^{7/2} log^2 n) to O(n^{5/2} log^2 n)

Demonstrated improved efficiency over previous methods

Provides a faster solution for geometric hitting set problems

Abstract

Given a set $P$ of $n$ weighted points and a set $H$ of $n$ half-planes in the plane, the hitting set problem is to compute a subset $P'$ of points from $P$ such that each half-plane contains at least one point from $P'$ and the total weight of the points in $P'$ is minimized. The previous best algorithm solves the problem in $O(n^{7/2}\log^2 n)$ time. In this paper, we present a new algorithm with runtime $O(n^{5/2}\log^2 n)$.