Computational geometry: an introduction
Computational geometry: an introduction
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Art gallery theorems and algorithms
Art gallery theorems and algorithms
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry: Theory and Applications
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Digitization scheme that assures faithful reconstruction of plane figures
Pattern Recognition
Experimental study on approximation algorithms for guarding sets of line segments
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
Complexity and approximability issues in combinatorial image analysis
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Approximation algorithms for a geometric set cover problem
Discrete Applied Mathematics
Watchman routes for lines and segments
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
| Hi-index | 5.23 |
We consider the following problem: Given a finite set of straight line segments in the plane, find a set of points of minimum size, so that every segment contains at least one point in the set. This problem can be interpreted as looking for a minimum number of locations of policemen, guards, cameras or other sensors, that can observe a network of streets, corridors, tunnels, tubes, etc. We show that the problem is strongly NP-complete even for a set of segments with a cubic graph structure, but in P for tree structures.