2016-03-172016-03-172011Claverol, M., Garijo Royo, D., Grima Ruiz, C.I., Márquez Pérez, A. y Seara Ojea, C. (2011). Stabbers of line segments in the plane. Computational Geometry, 44 (5), 303-318. https://doi.org/http://dx.doi.org/10.1016/j.comgeo.2010.12.004.http://hdl.handle.net/11441/38729The 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/StabbersTransversalLine segmentsRed-blue separabilityinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttp://dx.doi.org/10.1016/j.comgeo.2010.12.004https://idus.us.es/xmlui/handle/11441/38729