{ const random = d3.randomNormal(); let start; let delaunayInitTime = 0; let delaunaySearchTime = 0; let arraySortTime = 0; let arraySearchTime = 0; let bisectorTime = 0; let flatbushInitTime = 0; let flatbushTime = 0; const data = d3.range(numPoints).map((d) => ({ x: random(), y: random() })); const iterations = d3.range(numIterations); start = performance.now(); const delaunay = d3.Delaunay.from( data, (d) => d.x, (d) => d.y ); delaunayInitTime = performance.now() - start; start = performance.now(); for (const iter of iterations) { const x = random(); const y = random(); const foundIndex = delaunay.find(x, y); } delaunaySearchTime = performance.now() - start; if (numPoints < 50e3) { start = performance.now(); for (const iter of iterations) { const x = random(); const y = random(); var minPoint = d3.least(data, (d) => { const dx = d.x - x; const dy = d.y - y; return dx * dx + dy * dy; }); } arraySearchTime = performance.now() - start; } start = performance.now(); const find = fastFinder( data, (d) => d.x, (d) => d.y ); arraySortTime = performance.now() - start; start = performance.now(); for (const iter of iterations) { const x = random(); const y = random(); const foundPoint = find(x, y); } bisectorTime = performance.now() - start; start = performance.now(); const index = new Flatbush(data.length); for (const point of data) { index.add(point.x, point.y, point.x, point.y); } index.finish(); flatbushInitTime = performance.now() - start; start = performance.now(); for (const iter of iterations) { const x = random(); const y = random(); const foundIndex = index.neighbors(x, y, 1)[0]; const point = data[foundIndex]; } flatbushTime = performance.now() - start; return html`

Number of points: ${d3.format(`,.0f`)(numPoints)}

Iterations: ${d3.format(`,.0f`)(iterations.length)}

Delaunay initialization: ${d3.format(`,.0f`)(delaunayInitTime)}ms

Delaunay search: ${d3.format(`,.0f`)(delaunaySearchTime)}ms

Bisector initialization (array sort): ${d3.format(`,.0f`)( arraySortTime )}ms

Bisector search: ${d3.format(`,.0f`)(bisectorTime)}ms

Flatbush initialization: ${d3.format(`,.0f`)(flatbushInitTime)}ms

Flatbush search: ${d3.format(`,.0f`)(flatbushTime)}ms

Array search: ${ arraySearchTime ? d3.format(`,.0f`)(arraySearchTime) + `ms` : `way too long` }

`; }

Purpose-built for displays of data