1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
import { distance } from "./math.js";
import { polygonCentroid } from "d3-polygon";
export default function(start, end) {
let distances = start.map(p1 => end.map(p2 => squaredDistance(p1, p2))),
order = bestOrder(start, end, distances);
// Don't permute huge array
if (start.length > 8) {
return start.map((d, i) => i);
}
return bestOrder(start, end, distances);
}
export function bestOrder(start, end, distances) {
let min = Infinity,
best = start.map((d, i) => i);
function permute(arr, order = [], sum = 0) {
for (let i = 0; i < arr.length; i++) {
let cur = arr.splice(i, 1),
dist = distances[cur[0]][order.length];
if (sum + dist < min) {
if (arr.length) {
permute(arr.slice(), order.concat(cur), sum + dist);
} else {
min = sum + dist;
best = order.concat(cur);
}
}
if (arr.length) {
arr.splice(i, 0, cur[0]);
}
}
}
permute(best);
return best;
}
function squaredDistance(p1, p2) {
let d = distance(polygonCentroid(p1), polygonCentroid(p2));
return d * d;
}
(?:[a-z]+[\.])([a-z])+
|
