Closest pair of points problem: Revision history

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 23:5923:59, 14 October 2024 LR.127 talk contribs 9,236 bytes +53 Adding local short description: "Computational geometry problem", overriding Wikidata description "the problem of finding the two points with minimum distance from a larger finite set of points" undo Tag: Shortdesc helper

curprev 13:4813:48, 13 August 2023 OAbot talk contribs m 9,183 bytes +40 Open access bot: doi, hdl added to citation with #oabot. undo

curprev 23:3523:35, 28 January 2023 OAbot talk contribs m 9,100 bytes +20 Open access bot: doi, hdl added to citation with #oabot. undo

curprev 01:2401:24, 23 January 2023 Citation bot talk contribs 9,080 bytes +126 Add: url, hdl, s2cid. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 136/1134 undo

curprev 03:2303:23, 20 November 2022 Mako001 talk contribs m 8,954 bytes +88 Reverted edits by 105.245.106.84 (talk) to last revision by David Eppstein: unexplained content removal undo Tags: Rollback SWViewer [1.4]
curprev 03:2203:22, 20 November 2022 105.245.106.84 talk 8,866 bytes −88 No edit summary undo Tags: Reverted Visual edit Mobile edit Mobile web edit

curprev 23:1723:17, 19 October 2021 Prof. Details talk contribs 9,162 bytes +4,265 Dear Prof. David Eppstein -- I really hope you would agree -- the purpose of having this wikipedia page is NOT to show your cleverness, but to give an accurate account of the development of the problem and some of its possible solutions. Undid revision 1050796170 by David Eppstein (talk) undo Tags: Undo Reverted
curprev 23:0923:09, 19 October 2021 David Eppstein talk contribs 4,897 bytes −4,265 Undid revision 1050795982 by Prof. Details (talk) Let's not emphasize stupid and far-from-optimal algorithms here. undo Tags: Undo Reverted
curprev 23:0723:07, 19 October 2021 Prof. Details talk contribs 9,162 bytes +4,265 Undid revision 1017837506 by David Eppstein (talk) undo Tags: Undo Reverted

curprev 21:2821:28, 14 April 2021 David Eppstein talk contribs 4,883 bytes −4,265 Why are we spending so much effort describing bad algorithms for the problem when better ones exist? I don't understand this emphasis in CLRS and I don't understand it here. undo Tag: Reverted
curprev 20:2420:24, 14 April 2021 Dokidaki-ylc talk contribs 9,148 bytes +449 Add explicit explanation on how to achieve linear time for step 4 according to Cormen's Introduction to Algorithms: 1. create the array Y' with elements locating in the vertical strip and sorted w.r.t. y coordinates (linear time complexity) 2. for each point in the array Y', compute pair-wise distance with a constant number of points following the current point (linear time complexity) undo Tag: Visual edit