Bentley–Ottmann algorithm: Revision history

Article
Talk

View logs for this page (view filter log)

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 12:0012:00, 1 July 2014 131.159.0.47 talk 21,468 bytes 0 →Detailed algorithm undo

curprev 09:2409:24, 28 March 2014 Magioladitis talk contribs m 21,468 bytes −28 clean up using AWB (10060) undo

curprev 04:5004:50, 24 March 2014 142.254.1.249 talk 21,496 bytes −16 →Overall strategy undo
curprev 04:4904:49, 24 March 2014 142.254.1.249 talk 21,512 bytes +28 →Overall strategy: Edited for clarity & accesibility undo

curprev 06:3106:31, 16 September 2013 David Eppstein talk contribs 21,484 bytes +4 No, little o was correct — to replace it by an absolute inequality you need to know more than is stated here about the constant factors in the runtime of the algorithms. undo
curprev 06:0706:07, 16 September 2013 65.46.142.190 talk 21,480 bytes −4 Really, k should be less than a certain value, not of a certain order. Anyway. I swear this is my last edit. undo Tag: Visual edit
curprev 06:0606:06, 16 September 2013 65.46.142.190 talk 21,484 bytes 0 Changed little o to big o. Not sure if I made that change last time accidentally. Technically I think k = o would have been correct. k < O still works though. undo Tag: Visual edit
curprev 06:0406:04, 16 September 2013 65.46.142.190 talk 21,484 bytes 0 Corrected the equality operator to show the true values for which this algorithm is an improvement over the brute force method. undo Tag: Visual edit

curprev 10:1010:10, 11 September 2013 2001:6a0:5001:b:8ea9:82ff:fe24:35c4 talk 21,484 bytes +12 No edit summary undo

curprev 20:4720:47, 20 April 2013 Yobot talk contribs m 21,472 bytes +42 →External links: WP:CHECKWIKI error fixes - Replaced endash with hyphen in sortkey per WP:MCSTJR using AWB (9100) undo

curprev 08:4108:41, 18 March 2013 Addbot talk contribs m 21,430 bytes −57 Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q4060664 undo

curprev 12:1112:11, 21 December 2012 Gdr talk contribs 21,487 bytes −111 Bentley–Ottmann is only asymptotically faster than the naïve algorithm when k=o(n^2) undo

curprev 17:1817:18, 13 July 2012 76.199.15.26 talk 21,598 bytes +5 →Special position and numerical precision issues undo

curprev 05:5505:55, 12 May 2012 Helpful Pixie Bot talk contribs m 21,593 bytes +8 ISBNs (Build KH) undo

curprev 16:3516:35, 6 December 2011 David Eppstein talk contribs 21,585 bytes −1,663 Undid revision 464408728 by 123.28.15.78 (talk) There's already more readable pseudocode in the "detailed algorithm" section undo
curprev 16:2816:28, 6 December 2011 123.28.15.78 talk 23,248 bytes +1,663 No edit summary undo

curprev 21:1521:15, 15 November 2011 David Eppstein talk contribs 21,585 bytes +2 Category:Computational geometry undo

curprev 04:5204:52, 19 September 2011 CitationCleanerBot talk contribs m 21,583 bytes −4 →References: Various citation cleanup + WP:AWB fixes . Report errors and suggestions at User talk:CitationCleanerBot undo

curprev 02:3102:31, 2 June 2011 Blahbleh talk contribs 21,587 bytes +47 The naive algorithm would compare n segments to (n-1) neighbours, so would be O(n^2) undo

curprev 10:0710:07, 19 May 2011 Citation bot talk contribs m 21,540 bytes −14 [344]+: arxiv, mr. undo

curprev 21:2421:24, 17 September 2010 David Eppstein talk contribs m 21,554 bytes −15 →References: remove unused data (appears to be duplicate of author's middle initial) undo
curprev 21:0521:05, 17 September 2010 Citation bot 1 talk contribs m 21,569 bytes +12 Citations: [Pu186]Tweaked: unused_data. You can use this bot yourself. Report bugs here. undo

curprev 06:1606:16, 25 July 2010 David Eppstein talk contribs m 21,557 bytes +34 authorlink goodrich undo

curprev 20:5920:59, 20 May 2010 Shreevatsa talk contribs 21,523 bytes +66 →References: link to existing articles undo

curprev 17:1817:18, 5 May 2010 Citation bot 1 talk contribs m 21,457 bytes +52 Citation maintenance. [Pu131]Formatted: doi, last2, first2. You can use this bot yourself! Report bugs here. undo

curprev 16:5916:59, 3 May 2010 VolkovBot talk contribs m 21,405 bytes +9 robot Modifying: ru:Алгоритм Бентли — Оттмана undo

curprev 03:4703:47, 27 February 2010 David Eppstein talk contribs m 21,396 bytes +4 →References: link ijcga undo

curprev 21:4221:42, 15 January 2010 David Eppstein talk contribs m 21,392 bytes +8 →Faster algorithms: {{log-star}} undo

curprev 05:0505:05, 3 June 2009 David Eppstein talk contribs 21,384 bytes −7 →Overall strategy: rephrase sweep line intro undo

curprev 19:4619:46, 24 May 2009 DrilBot talk contribs m 686 bytes +40 Check Wikipedia cleanup (Misplaced interwikis and categories) + gen. fixes undo

curprev 23:2123:21, 16 April 2009 201.52.46.251 talk 646 bytes 0 →External Links undo
curprev 23:2123:21, 16 April 2009 201.52.46.251 talk 646 bytes +1 →External Links undo
curprev 23:2023:20, 16 April 2009 201.52.46.251 talk 645 bytes +147 →See also undo

curprev 04:3104:31, 12 November 2008 David Eppstein talk contribs 498 bytes +50 named after undo

curprev 02:3802:38, 11 November 2008 Amirshim talk contribs 448 bytes −178 →External links: - broken links undo

curprev 08:2508:25, 19 August 2008 81.222.208.214 talk 626 bytes +48 Languages undo

Retrieved from "https://en.wikipedia.org/wiki/Bentley–Ottmann_algorithm"