Cache-Oblivious Red-Blue Line Segment Intersection

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(\frac{N}{B}\log_{M/B}\frac{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.KeywordsExternal MemoryInput StreamSpace UsageOutput StreamMemory TransferThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.