Hi forum! A fun challenge for you guys. How do you find a pair of closest points, without producing sub optimal results? A point can be used only once to create a pair. [image] Suboptimal case 1: [image] Sub optimal case 2: It finds closest points, but when a point can not find a pair, it is…

[image] Closest point | two lists of points Grasshopper Found some minutes to make what you want … but Lila (the girl with the mental stability issues) said that the logic is LOL: since the outer loop works always against the 2 lists minus the previous pair … t…

Thank you for the answer! I know this thread, but this solution is incorrect

Ok, please explain as I used it in a project which seemed valid

[image] it finds pairs in two lists, not in one And some other methods posted in this thread: [image] pairs of closest points Hi all, I am wondering if anyone has any advice on the problem of finding pairs of closest points in a collection of points. By this I mean, different from …

Why did you replace standard Pop2D and Pop3D with Python? [image] dfytz1: Sub optimal case 2: It finds closest points, but when a point can not find a pair, it is forced to be paired with a very distant point. This does that: (can’t help with “hungarian matrix”) [Closest Pairs_2026Mar1a] …

Hi Jospeh, thank you for your attempt! I made those components instead of original ones, because they work a lot faster when i needed to make few thousand points. Standard components do not populate completely randomly, they populate in a way that avoids cluttering points too close together, i do n…

[image] dfytz1: I made those components instead of original ones, because they work a lot faster when i needed to make few thousand points. Standard components do not populate completely randomly, they populate in a way that avoids cluttering points too close together, i do not need that for thi…

It was a mistake, the algorithm in the post uses 2 opt refinement, not hungarian matrix (it was my previous attempt). It finds a list of candidates for each point within a max distance, and swaps used points until it gets the shortest solution. [image] https://en.wikipedia.org/wiki/2-opt| Hungar…

[Closest Pairs_2026Mar1c] Closest Pairs_2026Mar1c.gh (21.2 KB) [Closest Pairs_2026Mar1c3] [Closest Pairs_2026Mar1c2] [Closest Pairs_2026Mar1cc] Closest Pairs_2026Mar1cc.gh (21.2 KB)

nice attempt - you find candidates in a range of distances to the point, take the first one and delete it from initial set. the limitation is that you need a loop within a loop to store and later compare those candidates for optimization. And that is what implemented in the c# in the original post..…

Closest Pairs Problem

Grasshopper

cfee March 1, 2026, 12:48pm 2

Topic		Replies	Views
Find shortest connections between two sets of points (identical number) Grasshopper windows	13	753	May 1, 2024
Closest point \| two lists of points Grasshopper	10	3313	November 22, 2018
Matched pairs and closest points Grasshopper windows , rhino6	6	2177	May 12, 2021
Traveling Salesman Problem - Nearest Neighbor Heuristic Grasshopper	22	3840	October 4, 2020
Python exercise Scripting	50	8087	February 15, 2015

Closest Pairs Problem

Related topics