Cache-Oblivious Red-Blue Line Segment Intersection

DOI10.1007/978-3-540-87744-8_8MaRDI QIDQ3541077zbMATH OpenOpenAlexFDO

Authors Lars Arge, Thomas Mølhave, Norbert Zeh

Publication date 25 November 2008

Published in Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87744-8_8

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Counting and reporting red/blue segment intersections
• Publication:4945537
• scientific article; zbMATH DE number 2086641
• An optimal algorithm for intersecting line segments in the plane
• Line-segment intersection made in-place

Cites work

• scientific article; zbMATH DE number 1792106 (Why is no real title available?)
• scientific article; zbMATH DE number 2086641 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• Cache-oblivious algorithms
• External-memory algorithms for processing line segments in geographic information systems

Cited in

(4)

• Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
• scientific article; zbMATH DE number 2086641 (Why is no real title available?)
• Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection

This page was built for publication: Cache-Oblivious Red-Blue Line Segment Intersection

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