Reporting Bichromatic Segment Intersections from Point Sets

In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red and blue, we present an O(n2) time and space algorithm for solving the proble...

Descripción completa

Detalles Bibliográficos
Autores: Cortés Parejo, María del Carmen, Garijo Royo, Delia, Garrido Vizuete, María de los Angeles, Grima Ruiz, Clara Isabel, Márquez Pérez, Alberto, Moreno González, Auxiliadora, Valenzuela Muñoz, Jesús, Villar Liñán, María Trinidad
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2012
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/38750
Acceso en línea:http://hdl.handle.net/11441/38750
https://doi.org/10.1142/S0218195912500100
Access Level:acceso abierto
Palabra clave:Red-blue points
bichromatic segment intersection
discrimination and separation
Descripción
Sumario:In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red and blue, we present an O(n2) time and space algorithm for solving the problem of reporting the set of segments of each color intersected by segments of the other color. We also prove that this problem is 3-Sum hard and provide some illustrative examples of several point configurations.

Similares en LA Referencia