Orthogonal segment stabbing

Authors:
Matthew J. Katz;Joseph S. B. Mitchell;Yuval Nir
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel
Venue:
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Year:
2005

Citing 5
Cited 2

On grid intersection graphs

Discrete Mathematics
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Visibility preserving terrain simplification: an experimental study

Proceedings of the eighteenth annual symposium on Computational geometry
Minimum-link watchman tours

Information Processing Letters

Cooperative mobile guards in grids

Computational Geometry: Theory and Applications
Red-blue covering problems and the consecutive ones property

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.