Artículo
Stabbers of line segments in the plane
Autor/es | Claverol, Mercé
Garijo Royo, Delia Grima Ruiz, Clara Isabel Márquez Pérez, Alberto Seara Ojea, Carlos |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2011 |
Fecha de depósito | 2016-03-17 |
Publicado en |
|
Resumen | 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 ... 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. |
Cita | Claverol, 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Stabbers.pdf | 327.5Kb | [PDF] | Ver/ | |