论文信息 - Convex partial transversals of planar regions

Convex partial transversals of planar regions

We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for the case where the regions are disjoint line segments with a constant number of orientations. On the other hand, we show that the problem is NP-hard when the regions are intersecting axis-aligned rectangles or 3-oriented line segments. For several natural intermediate classes of shapes (arbitrary disjoint segments, intersecting 2-oriented segments) the problem remains open.

[1] Martin Tompa. An Optimal Solution to a Wire-Routing Problem , 1981, J. Comput. Syst. Sci..

[2] Gerhard J. Woeginger,et al. Counting k-Subsets and Convex k-gons in the Plane , 1991, Inf. Process. Lett..

[3] Mark H. Overmars,et al. New methods for computing visibility graphs , 1988, SCG '88.

[4] David Eppstein,et al. Finding minimum areak-gons , 1992, Discret. Comput. Geom..

[5] Joseph S. B. Mitchell,et al. Counting Convex Polygons in Planar Point Sets , 1995, Inf. Process. Lett..

[6] Matthew J. Katz,et al. Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals , 2012, CCCG.

[7] Sariel Har-Peled,et al. On conflict-free coloring of points and simple regions in the plane , 2003, SCG '03.

[8] Esther M. Arkin,et al. Convex transversals , 2014, Comput. Geom..

[9] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[10] Dana Ron,et al. Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks , 2003, SIAM J. Comput..

[11] Michael T. Goodrich,et al. Stabbing Parallel Segments with a Convex Polygon , 1990, Comput. Vis. Graph. Image Process..

[12] Lena Schlipf. Notes on Convex Transversals , 2012, ArXiv.

[13] Esther M. Arkin,et al. Conflict-free Covering , 2015, CCCG.