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

DOI10.1007/3-540-61680-2_64MaRDI QIDQ4595496zbMATH OpenOpenAlexFDO

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

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61680-2_64

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Reporting red-blue intersections between two sets of connected ine segments
• An elementary algorithm for reporting intersections of red/blue curve segments
• Counting and reporting red/blue segment intersections
• Reporting bichromatic segment intersections from point sets
• Reporting curve segment intersections using restricted predicates
• Reporting Intersections of Polygons
• Reporting and counting segment intersections
• scientific article; zbMATH DE number 1786518
• Line-segment intersection reporting in parallel

Cited in

(8)

• Reporting and counting segment intersections
• Reporting Intersections of Polygons
• Reporting red-blue intersections between two sets of connected ine segments
• Reporting intersecting pairs of convex polytopes in two and three dimensions
• Kinetic hanger
• 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

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

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