Revision as of 17:22, 27 August 2019 edit Bender the Bot (talk \| contribs) Bots 1,064,377 edits m →Applications: HTTP → HTTPS for Tufts CS, replaced: http://www.cs.tufts.edu/ → https://www.cs.tufts.edu/ Tag: AWB ← Previous edit		Revision as of 00:46, 13 September 2020 edit undo Citation bot (talk \| contribs) Bots 5,868,968 edits Add: url, s2cid. \| You can use this bot yourself. Report bugs here. \| Suggested by SemperIocundus \| via #UCB_webform Next edit →
Line 16: \| pages = 208–215 \| title = Proc. 17th IEEE Symp. Foundations of Computer Science (FOCS '76) \| year = 1976\| s2cid = 124804 \| url = http://euro.ecom.cmu.edu/shamos.html }}.</ref> The closely related [[Bentley–Ottmann algorithm]] uses a sweep line technique 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