Revision as of 12:11, 21 December 2012 edit Gdr (talk \| contribs) Extended confirmed users 29,064 edits Bentley–Ottmann is only asymptotically faster than the naïve algorithm when k=o(n^2) ← Previous edit		Revision as of 08:41, 18 March 2013 edit undo Addbot (talk \| contribs) Bots 2,838,809 edits m Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q4060664 Next edit →
Line 78: [[Category:Computational geometry]] ~~[[ru:Алгоритм Бентли — Оттмана]]~~

Bentley–Ottmann algorithm: Difference between revisions