Partitioning arrangements of lines I: An efficient deterministic algorithm

K-set (geometry)

In discrete geometry, a k-set of a finite point set S in the Euclidean plane is a subset of k elements of S that can be strictly separated from the remaining points by a…