Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Efficient algorithms for common transversals
Information Processing Letters
Topologically sweeping an arrangement
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Lower bounds for line stabbing
Information Processing Letters
Computing shortest transversals of sets (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM
Separating objects in the plane by wedges and strips
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On intersecting a set of parallel line segments with a convex polygon of minimum area
Information Processing Letters
On intersecting a set of isothetic line segments with a convex polygon of minimum area
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
| Hi-index | 0.00 |
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a double-wedge and a zigzag. The time and space complexities of the algorithms depend on the number of combinatorially different extreme lines, critical lines, and the number of different slopes that appear in S.