6
votes
5answers
277 views

A fast way to calculate the median difference between pairs of elements

I have a list of coordinate pairs, take for example the following list of three pairs: ...
0
votes
0answers
22 views

Pruning a list of points to find the largest clique of points with a minimum threshold point-to-point Euclidean distance [duplicate]

I have a array of points (which we'll just create randomly here): pointList = Table[{RandomReal[{0, 5}], RandomReal[{0, 5}]}, {i, 1, 100}]; I'd like to find the ...
5
votes
2answers
255 views

Pruning elements in an array based on the existence of similar elements in adjacent arrays

Imagine I have a series of particles floating around in $\mathrm{R}^3$, where, at any given time, particles can pop into and out of existence. Here, for some number of time points, $(t_1, \dots, ...
2
votes
3answers
94 views

Reversibly merging sets of $k$ adjacent elements in an array

Say I have an array of the form: ExampleArray = {{1}, {2}, {3}, {4}, {5}, {6}, {7}, {8}, {9}, {10}, {11}, {12}}; I'd like to be able to reversibly merge sets of ...
2
votes
1answer
237 views

Finding a fixed vector which minimizes the pairwise distance between noisy elements in two unordered arrays

Let $A$ and $B$ be two sets of $d$-dimensional coordinates of comparible (though not necessarily equal length). For example, here we can set $d = 3$ and have normalized values like: ...
1
vote
1answer
100 views

Finding a mapping between elements in two lists that satisfy some criterion (such as being less than threshold Euclidean distance apart)?

I have two lists of $d$-dimensional coordinates, for example setting $d=3$ we might write: ...