2 search results - page 1 / 1 » Intersecting Red and Blue Line Segments in Optimal Time and ... |
72
Voted
JCDCG
2000
Springer
15 years 2 months ago
2000
Springer
ESA
2008
Springer
15 years 5 days ago
2008
Springer
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 plan...