Discrete Mathematics
Visibility preserving terrain simplification: an experimental study
Proceedings of the eighteenth annual symposium on Computational geometry
Information Processing Letters
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
An efficient algorithm for mobile guarded guards in simple grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Hi-index | 0.00 |
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.