Reporting red-blue intersections between two sets of connected ine segments

DOI10.1007/S00453-002-0967-4MaRDI QIDQ1566372zbMATH OpenOpenAlexFDO

Authors Julien Basch, Leonidas Guibas, G. D. S. Ramkumar

Publication date 2 June 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-002-0967-4

zbMATH Keywords

computational geometryheapsplane sweepsegment intersection

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Reporting red-blue intersections between two sets of connected line segments
• Counting and reporting red/blue segment intersections
• An elementary algorithm for reporting intersections of red/blue curve segments
• Reporting bichromatic segment intersections from point sets
• Reporting and counting segment intersections
• Reporting curve segment intersections using restricted predicates
• Reporting Intersections of Polygons
• Line-segment intersection reporting in parallel

Cited in

(9)

• Topological sweep of the complete graph
• Reporting and counting segment intersections
• Reporting Intersections of Polygons
• On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
• Intersecting red and blue line segments in optimal time and precision
• Reporting red-blue intersections between two sets of connected line segments
• Counting and reporting red/blue segment intersections
• Reporting bichromatic segment intersections from point sets
• An elementary algorithm for reporting intersections of red/blue curve segments

This page was built for publication: Reporting red-blue intersections between two sets of connected ine segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566372)