REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS

DOI10.1142/S0218195912500100zbMath1267.68266OpenAlexW1996383636WikidataQ128213549 ScholiaQ128213549MaRDI QIDQ5300004

J. Valenzuela, Carmen Cortés, María Trinidad Villar, Delia Garijo, María Ángeles Garrido, Clara I. Grima, Auxiliadora Moreno-González, Alberto Márquez

Publication date: 24 June 2013

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195912500100

zbMATH Keywords

red-blue pointsbichromatic segment intersectiondiscrimination and separation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Convex Quadrangulations of Bichromatic Point Sets

Cites Work

• On a notion of data depth based on random simplices
• Partitioning arrangements of lines. II: Applications
• Cutting hyperplanes for divide-and-conquer
• On a class of \(O(n^ 2)\) problems in computational geometry
• Algorithms for Reporting and Counting Geometric Intersections
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Algorithms for ray-shooting and intersection searching
• An optimal algorithm for intersecting line segments in the plane
• Reporting red-blue intersections between two sets of connected line segments
• The 1972 Wald Lecture Robust Statistics: A Review