Bounded Voronoi Tessellation
This interactive visualization demonstrates a bounded Voronoi tessellation, where 100 randomly placed sites partition the SVG canvas into colored polygonal cells. The mouse controls the first site, dynamically updating the diagram as it moves. The code uses d3.voronoi to compute the tessellation and d3.polygonHull to create a convex hull around the sites, which is then expanded outward to bound the diagram. Artificial points are added along this expanded hull to ensure the Voronoi cells are fully enclosed, with the generator sites rendered as circles and the convex hull traced as a pink line.
AI-generated descriptionBounded Voronoi Tesselation using the algorithm described in xlr8r.info
See the variant: Circular Bounded Voronoi Tesselation.
Based on <a href='http://bl.ocks.org/mbostock/'>mbostock</a>'s block: <a href='http://bl.ocks.org/mbostock/4060366'>Voronoi Tessellation</a>
Author: Philippe Rivière, August 2016