Abstract
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plane. Our algorithm uses O(N/B log M/B N/B + T/B) memory transfers, where N is the total number of segments, M and B are the memory and block transfer sizes of any two consecutive levels of any multilevel memory hierarchy, and T is the number of intersections. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Arge, L., Mølhave, T., & Zeh, N. (2008). Cache-oblivious red-blue line segment intersection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 88–99). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
