Voronoi binning

Use Voronoi.find() to group data by the Voronoi cells of the top 10% data points.

Original work by Philippe Rivière for d3-voronoi (issue 17).

forked from Fil's block: Voronoi binning

<!DOCTYPE html>
<meta charset="utf-8">
<style>
circle {
  stroke: #444;
}
</style>
<svg width="960" height="500"></svg>
<script src="https://d3js.org/d3.v4.min.js"></script>
<script>
 
var svg = d3.select("svg"),
    width = +svg.attr("width"),
    height = +svg.attr("height");

var color = d3.scaleOrdinal().range(d3.schemeCategory20b);

var n = 4000;
  
var data = d3.range(n)
    .map(function(d,i) { return [Math.random() * width, Math.random() * height, color(i), Math.random()]; });

var voronoi = d3.voronoi() 
    .size([width, height]);

var sites = data.sort(function(a,b) {
  return d3.descending(a[3], b[3]);
})
.slice(0,n/10);

var diagram = voronoi(sites);
diagram.find = find;

d3.select('svg')
.append('g')
.selectAll('circle')
.data(data)
.enter()
.append('circle')
.attr('r', function(d) {return 10 * d[3] * d[3];})
.attr('transform', function(d) { return 'translate('+ [ d[0], d[1] ] +')'; })
.attr('fill', function(d) {
  var found = diagram.find(d[0],d[1]);
  return sites[found.index][2];
});

} while (next !== null);

diagram.find.found = i;
  if (!radius || dist < radius * radius) return cell.site;
}

</script>

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