Notes on Convex Transversals
Computational Geometry
2012-11-22 v1
Abstract
In this paper, we prove the problem of stabbing a set of disjoint bends by a convex stabber to be NP-hard. We also consider the optimization version of the convex stabber problem and prove this problem to be APX-hard for sets of line segments.
Cite
@article{arxiv.1211.5107,
title = {Notes on Convex Transversals},
author = {Lena Schlipf},
journal= {arXiv preprint arXiv:1211.5107},
year = {2012}
}