function* samples(radius, random = d3.randomLcg(37), k = 30) {
const radius2 = radius * radius;
const radius2_3 = 3 * radius2;
const cellSize = radius * Math.SQRT1_2;
const gridWidth = 1024;
const gridHeight = 1024;
const grid = new Array(gridWidth * gridHeight);
const queue = [];
yield [null, sample(0, 0)];
pick: while (queue.length) {
const i = random() * queue.length | 0;
const parent = queue[i];
for (let j = 0; j < k; ++j) {
const a = 2 * Math.PI * random();
const r = Math.sqrt(random() * radius2_3 + radius2);
const x = parent[0] + r * Math.cos(a);
const y = parent[1] + r * Math.sin(a);
if (far(x, y)) {
yield [parent, sample(x, y)];
continue pick;
}
}
const r = queue.pop();
if (i < queue.length) queue[i] = r;
}
function cell(x, y) {
return [
Math.floor(x / cellSize) + (gridWidth >> 1),
Math.floor(y / cellSize) + (gridHeight >> 1)
];
}
function far(x, y) {
const [i, j] = cell(x, y);
const i0 = Math.max(i - 2, 0);
const j0 = Math.max(j - 2, 0);
const i1 = Math.min(i + 3, gridWidth);
const j1 = Math.min(j + 3, gridHeight);
for (let j = j0; j < j1; ++j) {
const o = j * gridWidth;
for (let i = i0; i < i1; ++i) {
const s = grid[o + i];
if (s) {
const dx = s[0] - x;
const dy = s[1] - y;
if (dx * dx + dy * dy < radius2) return false;
}
}
}
return true;
}
function sample(x, y, parent) {
const [i, j] = cell(x, y);
const xy = [x, y];
queue.push(grid[gridWidth * j + i] = xy);
return xy;
}
}