Skip to main content
SimilarExport ZIP
100%

Voronoï playground: Voronoï treemap (study 3)

✓ Published0🌍 Public
KKcnarf
Last edited Dec 3, 2018
Created on Dec 18, 2017

This example shows a hierarchical Voronoï treemap, where nested data is partitioned into a circular diagram using weighted Voronoï cells. The visualization displays either the weighted Voronoï cells, the cell weights as circles, or both, with an option to toggle site visibility. It uses the d3-voronoi-map plugin to recursively compute one-level Voronoï maps for each hierarchy level, clipping polygons for child nodes as they are generated. The code builds on d3.hierarchy and d3.scaleOrdinal with the d3.schemeSet1 color palette, rendering the result as SVG.

AI-generated description

This block experiments how to produce a hierarchical Voronoï treemap based on hierarchical/nested data (cf. d3.hierarchy). It uses the d3-voronoi-map plugin which compute one-level Voronoï maps.

Notes :

  • the algorithm, initiated with the root node and the clipping polygon, is as follow:
  • if node as children, compute the one-level Voronoï map of the clipping polygon and the children's data, thanks to the d3-voronoi-map
  • repeat for each child with children and child-related computed polygon
  • this is a layered algorithm: the Voronoï map of a particular node must be computed/stabilized before computing nested Voronoï maps of nested data; this approach ensures that clipping polygons remain the same when computing nested Voronoï maps; otherwise, the algorithm should handle sites that may become out of clipping polygons

User interactions :

  • you can choose to draw the Weighted Voronoï Diagram (default), the weights (visualized as circles), or both.
  • you can hide/show sites.

Acknowledgments to :

gpl-3.0 Licensed

Similar vizzes

Loading thumbnail…

Voronoï playground: Voronoï map (study)

A Voronoï map study demonstrates an iterative weighted Voronoï treemap algorithm, positioning and re-weighting sites until their cell areas match expected sizes. The canvas rendering offers toggles for displaying either the weighted Voronoï diagram or site weights as circles, plus grey, radial rainbow, or conical rainbow color schemes. It relies on the `d3-weighted-voronoi` plugin and D3 v4, with user controls to show or hide site markers.

KKcnarf
88% match
Loading thumbnail…

Voronoï playground: Voronoï map (study 2)

This interactive Voronoï map demonstrates an algorithm for computing weighted Voronoï treemaps, where each cell’s area corresponds to a target weight. Users can toggle between displaying the weighted Voronoï cells, the weights as circles, or both, and can also show site locations and switch among grey, radial rainbow, or conical rainbow color schemes. The implementation relies on D3.js v4, the d3-weighted-voronoi plugin, and Canvas rendering, using heuristics to manage overweighted sites, mitigate near-zero weights, and reduce flickering during iterative repositioning and re-weighting. The map’s input data is generated procedurally with 20 sites, including a few outliers with higher weights.

KKcnarf
86% match
Loading thumbnail…

Weighted Voronoi Treemap in D3v4

This example demonstrates a weighted Voronoi treemap, which recursively subdivides a polygon into cells based on hierarchical data from the flare.json dataset. The visualization adapts cell sizes to reflect node values while offering interactive controls for changing the bounding polygon shape, color scheme, and maximum display depth. Built with D3 v4, the code uses several custom libraries, including ConvexHull.js, PowerDiagram.js, and d3.polygonClip, to compute the Voronoi diagram and render the resulting polygons as SVG paths.

KKcnarf
83% match
Loading thumbnail…

Voronoï playground : interactive weighted Voronoï study III (multiple sites)

An interactive study of weighted Voronoi diagrams, this d3.v4 visualization shows four draggable sites (two blue, two green) and their influence areas, or cells, within a rectangular clipping polygon. Sliders control the weight of each color group, and unit circles around sites indicate their relative weights. The diagram is computed via a parabolic power diagram algorithm, with convex hulls and 3D-to-2D dual-point mapping, then clipped using the Sutherland–Hodgman method via `d3.polygonClip`. Cell polygons render in SVG with transitions, while `d3.select` manages user interactions.

KKcnarf
82% match
Loading thumbnail…

Animated Voronoï map

This example demonstrates an animated Voronoï map that self-organizes over time, showing both live iterative updates and a static final arrangement. The visualization uses the d3-voronoi-map plugin (v2) to compute weighted Voronoï diagrams on a circular clipping polygon, with each iteration rendered on canvas. Users can toggle between drawing the Voronoï cells, their weights as circles, or both, and choose among greyscale, radial rainbow, or conical rainbow backgrounds. The code relies on d3.v5 and the d3-weighted-voronoi plugin, with user interactions handled through HTML radio buttons and checkboxes.

KKcnarf
81% match
Loading thumbnail…

Voronoï playground: animating the addition/removing of data on a Voronoï map

This visualization animates the transition between two Voronoï maps, showing how cell areas shift when data points are added, removed, or updated. Red cells mark exiting data, green cells mark entering data, and blue cells represent updated values whose areas change accordingly. A slider interpolates between the starting and ending tessellations, while a toggle reveals the underlying sites whose radii encode the data values. The implementation combines D3 v6 with the d3-voronoi-map and d3-weighted-voronoi plugins, computing interpolated site positions and weights via linear interpolation before rebuilding each intermediate map.

KKcnarf
80% match
Loading thumbnail…

Voronoï playground: Voronoï transitioning thanks to weighted Voronoï

This example demonstrates smooth transitions between two Voronoï tessellations of blue and green sites, where a slider adjusts the relative weights of each group, causing one set of sites to dominate the diagram and the other to fade out. It uses weighted Voronoï diagrams via the d3-weighted-voronoi plugin, with cells computed by a custom power diagram integrated with a convex hull algorithm and clipped to a circular SVG boundary. The animation updates cell polygons and site visibility in D3 v4, rendering SVG paths with a slider that recalibrates site weights to shift the tessellation.

KKcnarf
79% match
Loading thumbnail…

Voronoï playground : interactive weighted Voronoï study II

This interactive visualization explores the 2D additive weighted power diagram, showing how two draggable sites partition a rectangular area into concave cells whose borders shift as sliders adjust each site’s weight. The diagram is computed via a convex hull algorithm (ConvexHull.js, PowerDiagram.js) that lifts sites to a paraboloid, with the resulting polygons clipped using a Sutherland–Hodgman implementation from d3-polygon-clip. Rendered in SVG with D3 v4, the display updates live, and circles around each site scale with the square root of the weight to visualize its influence.

KKcnarf
79% match