Simulation.find() multiple

This example demonstrates using d3.drag with d3.forceCollide to implement draggable circles with collision detection.

forked from mbostock's block: Force Dragging II

<!DOCTYPE html>
<meta charset="utf-8">
<canvas width="960" height="500"></canvas>
<script src="https://d3js.org/d3.v4.min.js"></script>
<script>

var canvas = document.querySelector("canvas"),
    context = canvas.getContext("2d"),
    width = canvas.width,
    height = canvas.height,
    radius = 20;

var circles = d3.range(324).map(function(i) {
  return {
    x: (i % 25) * (radius + 1) * 2,
    y: Math.floor(i / 25) * (radius + 1) * 2
  };
});

var simulation = d3.forceSimulation(circles)
    .force("collide", d3.forceCollide(radius + 1).iterations(4))
    .on("tick", drawCircles);

d3.select(canvas)
    .call(d3.drag()
        .container(canvas)
        .subject(dragsubject)
        .on("start", dragstarted)
        .on("drag", dragged)
        .on("end", dragended));

function drawCircles() {
  context.clearRect(0, 0, width, height);
  context.save();
  context.beginPath();
  circles.forEach(drawCircle);
  context.fill();
  context.strokeStyle = "#fff";
  context.stroke();
}

function drawCircle(d) {
  if (d.found) return;
  context.moveTo(d.x + radius, d.y);
  context.arc(d.x, d.y, radius, 0, 2 * Math.PI);
}
  
simulation.find = function(x, y, radius, quantity = 0) {
  nodes = simulation.nodes();
  var i = 0,
      n = nodes.length,
      dx,
      dy,
      d2,
      node,
      closest,
      innerRadius;

if (n < quantity) return nodes.concat();
  if (quantity) closest = [];

if (radius == null) radius = Infinity;
  else radius *= radius;

for (i = 0; i < n; ++i) {
    node = nodes[i];
    dx = x - node.x;
    dy = y - node.y;
    d2 = dx * dx + dy * dy;
    if (d2 < radius) {
      if (quantity > 1) {
        if (!closest.length) {
          closest.push(node);
          innerRadius = d2;
        } else {
          if (d2 < innerRadius) {
            innerRadius = d2;
            closest.unshift(node);
          	if (closest.length >= quantity) {
              d2 = closest[closest.length - 1];
              radius = d2.x * d2.x + d2.y * d2.y;
            }
          } else {
            closest.push(node);
          	if (closest.length >= quantity) radius = d2;
          }
        }
      } else {
        closest = quantity ? [node] : node;
  	    radius = d2;
      }
    }
  }

return closest;
};

function dragsubject() {
  simulation.find(d3.event.x, d3.event.y, 100, 20).forEach(function (d) { d.found = true; });
  return simulation.find(d3.event.x, d3.event.y, radius);
}

function dragstarted() {
  if (!d3.event.active) simulation.alphaTarget(0.3).restart();
  d3.event.subject.fx = d3.event.subject.x;
  d3.event.subject.fy = d3.event.subject.y;
}

function dragged() {
  d3.event.subject.fx = d3.event.x;
  d3.event.subject.fy = d3.event.y;
}

function dragended() {
  simulation.nodes().forEach(function (d) { d.found = false; })
  if (!d3.event.active) simulation.alphaTarget(0);
  d3.event.subject.fx = null;
  d3.event.subject.fy = null;
}

</script>

https://d3js.org/d3.v4.min.js