| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10327454 | Computational Geometry | 2005 | 9 Pages |
Abstract
We study a class of geometric stabbing/covering problems for sets of line segments, rays and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical line segments are NP-complete, we show that versions involving (parallel) rays or lines are polynomially solvable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Matthew J. Katz, Joseph S.B. Mitchell, Yuval Nir,