Revision as of 04:17, 12 November 2008 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,726 edits templatize refs and clean up math ← Previous edit		Revision as of 04:29, 12 November 2008 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,726 edits m missed an italicization Next edit →
Line 12: \| page = 208–215 \| title = Proc. 17th IEEE Symp. Foundations of Computer Science (FOCS '76) \| year = 1976}}.</ref> and it also makes it possible to report all ''K'' intersections among any ''N'' segments in the plane in time complexity of O((''N'' + ''K'') log ''N'') and space complexity of O(''N'').<ref>{{citation \| last = Souvaine \| first = Diane \| author-link = Diane Souvaine \| title = Line Segment Intersection Using a Sweep Line Algorithm

Sweep line algorithm: Difference between revisions