27:null 28:["$","title",null,{"children":"Bridson’s Algorithm | Josh Holder | Observable"}] 2d:T403,chart = { const height = 600; const svg = d3.create("svg").attr("viewBox", [0, 0, width, height]); replay; for (const event of poissonDiscSampler(width, height, 10)) { if (event.add) { event.parent && svg.insert("line", "circle") .attr("x1", event.parent[0]) .attr("y1", event.parent[1]) .attr("x2", event.add[0]) .attr("y2", event.add[1]) .attr("stroke", "#999"); svg.append("circle") .attr("id", `point-${event.add.map(Math.round).join("-")}`) .attr("r", 0) .attr("cx", event.add[0]) .attr("cy", event.add[1]) .transition() .ease(d3.easeLinear) .attr("r", Math.random()*5) .transition() .attr("fill", "#f00"); } else if (event.remove) { svg.select(`#point-${event.remove.map(Math.round).join("-")}`) .transition() .ease(d3.easeLinear) .attr("fill", "#999") .attr("r", 2); } yield svg.node(); } }2e:T878,function* poissonDiscSampler(width, height, radius) { const k = 30; // maximum number of samples before rejection const radius2 = radius * radius; const radius2_3 = 3 * radius2; const cellSize = radius * Math.SQRT1_2; const gridWidth = Math.ceil(width / cellSize); const gridHeight = Math.ceil(height / cellSize); const grid = new Array(gridWidth * gridHeight); const queue = []; // Pick the first sample. yield {add: sample(width / 2 + Math.random() * radius, height / 2 + Math.random() * radius, null)}; // Pick a random existing sample from the queue. pick: while (queue.length) { const i = Math.random() * queue.length | 0; const parent = queue[i]; // Make a new candidate between [radius, 2 * radius] from the existing sample. for (let j = 0; j < k; ++j) { const a = 2 * Math.PI * Math.random(); const r = Math.sqrt(Math.random() * radius2_3 + radius2); const x = parent[0] + r * Math.cos(a); const y = parent[1] + r * Math.sin(a); // Accept candidates that are inside the allowed extent // and farther than 2 * radius to all existing samples. if (0 <= x && x < width && 0 <= y && y < height && far(x, y)) { yield {add: sample(x, y), parent}; continue pick; } } // If none of k candidates were accepted, remove it from the queue. const r = queue.pop(); if (i < queue.length) queue[i] = r; yield {remove: parent}; } function far(x, y) { const i = x / cellSize | 0; const j = y / cellSize | 0; 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 s = grid[gridWidth * (y / cellSize | 0) + (x / cellSize | 0)] = [x, y]; queue.push(s); return s; } }2f:[] 2b:{"id":"3a9574f08f9dd082","slug":null,"title":"Bridson’s Algorithm","thumbnail":"587d6e3bf5c0c98537d251ea2ae39931be5736413668d70329e8c081d88a3ced","access_level":"public","create_time":"$D2023-03-10T11:44:18.082Z","update_time":"$D2023-03-10T11:45:08.873Z","view_time":null,"first_public_time":"$D2023-03-10T11:44:18.082Z","has_unpublished_edits":null,"fork":{"id":"b968ef8147786375","slug":"poisson-disc-distribution","title":"Bridson’s Algorithm","owner":{"id":"8c2e47252fd4995c","login":"mbostock","name":"Mike Bostock"}},"stars":1,"starred":false,"owner":{"type":"team","id":"af3f0b40141897fd","login":"jholder112233","name":"Josh Holder","avatar_url":"https://avatars-next.observableusercontent.com/db398c57c1bb986cff2ee224449fb9be5e3c855ae363e253e2fec54a601d77b7","tier":"starter_2024"},"version":261,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"eed4261d79580634","login":"jholder112233","name":"Josh Holder","avatar_url":"https://avatars-next.observableusercontent.com/db398c57c1bb986cff2ee224449fb9be5e3c855ae363e253e2fec54a601d77b7","tier":null}],"members":[{"type":"individual","id":"eed4261d79580634","login":"jholder112233","name":"Josh Holder","avatar_url":"https://avatars-next.observableusercontent.com/db398c57c1bb986cff2ee224449fb9be5e3c855ae363e253e2fec54a601d77b7","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"Bridson’s Algorithm","cells":[{"id":1,"value":"md`# Bridson’s Algorithm\n\nThis algorithm efficiently generates [poisson-disc samples](https://dl.acm.org/citation.cfm?id=1278807).`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":236,"value":"viewof replay = html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":9,"value":"$2d","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":3,"value":"$2e","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":118,"value":"d3 = require(\"d3@5\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W2f","stdlib":"1","titling":"auto"}} 2c:"$2b:body"