2 citations · 4 across the 12 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CG2012
Notes on Convex Transversals
Lena Schlipf
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 a…
cs.CG2012
Covering and Piercing Disks with Two Centers
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer +3
We give exact and approximation algorithms for two-center problems when the input is a set of disks in the plane. We first study the problem of finding two smallest c…