  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.
