Resumen de Stabbers of line segments in the plane

M. Claverol, D. Garijo, Clara Isabel Grima Ruiz , Alberto Márquez Pérez , C. Seara

• The problem of computing a representation of the stabbing lines of a set S of n line segments in the plane was solved by Edelsbrunner et al. with an (n log n) time and O(n) space algorithm. We present a study of different types of stabbers such as wedges, double-wedges, 2-level trees, and zigzags; providing efficient algorithms whose time and space complexities depend on the number of combinatorially different extreme lines hS or critical lines cS, and the number kS of different slopes that appear in S.