Counting and reporting red/blue segment intersections

DOI10.1007/3-540-57155-8_277MaRDI QIDQ5060144zbMATH OpenOpenAlexFDO

Authors Larry Palazzi, Jack Snoeyink

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_277

Mathematics Subject Classification ID

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

Recommendations

• An elementary algorithm for reporting intersections of red/blue curve segments
• Line-segment intersection made in-place
• Reporting red-blue intersections between two sets of connected ine segments
• Reporting red-blue intersections between two sets of connected line segments
• scientific article; zbMATH DE number 1786518

Cites work

• Algorithms for Reporting and Counting Geometric Intersections
• Batched dynamic solutions to decomposable searching problems
• Fractional cascading. I: A data structuring technique
• Fractional cascading. II: Applications
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)

Cited in

(10)

• Reporting red-blue intersections between two sets of connected ine segments
• Reporting curve segment intersections using restricted predicates
• Reporting and counting segment intersections
• Cache-Oblivious Red-Blue Line Segment Intersection
• scientific article; zbMATH DE number 1786518 (Why is no real title available?)
• Towards an optimal method for dynamic planar point location
• Reporting red-blue intersections between two sets of connected line segments
• Algorithms and Data Structures
• An elementary algorithm for reporting intersections of red/blue curve segments
• External-memory algorithms for processing line segments in geographic information systems

This page was built for publication: Counting and reporting red/blue segment intersections

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