geoVoronoi Delaunay links and Urquhart graph

100%

geoVoronoi Delaunay links and Urquhart graph

✓ Published0🌍 Public

Last edited Aug 28, 2019

Created on Sep 12, 2016

One hundred random points on a sphere generate a geospatial Voronoi diagram, with Delaunay links drawn as white lines and the Urquhart graph subset emphasized in bold. The d3-geo-voronoi library computes the tessellation, while d3.geoPath and an orthographic projection render the polygons and links to SVG. Sites appear as open circles. The legend notes the graph distinction.

AI-generated description

Skeletal demo for d3.geoVoronoi

by Philippe Rivière.

mit Licensed

Similar vizzes

Loading thumbnail…

geoVoronoi circumcircles

This example visualizes the Voronoi tessellation of a sphere using 100 random points, rendered as colored triangles with white links and site markers. Hovering over a triangle reveals its circumcircle, drawn as a semi-transparent circle with dashed rays connecting the circumcenter to each vertex. Built with D3 v5 and the d3-geo-voronoi plugin, it uses d3.geoPath with an Equal Earth projection to draw the geometry in SVG, and d3.geoCircle to construct the interactive circumcircles.

PPhilippe Rivière

87% match

Loading thumbnail…

geoVoronoi triangles()

This example visualizes a spherical Voronoi triangulation of 100 random points, with each triangle filled by a random hue and the original sites marked as white dots. The orthographic projection rotates continuously to reveal the globe’s surface. Built with d3-geo-voronoi and d3-delaunay, it uses d3.geoPath and d3.geoOrthographic to render SVG paths, while d3.interval drives the animation by updating the projection’s rotation every 50 milliseconds. The points are generated as a GeoJSON FeatureCollection with coordinates spanning longitude 0–360 and latitude from -90 to 90.

PPhilippe Rivière

85% match

Loading thumbnail…

geoVoronoi polygons()

One hundred random points on a sphere are partitioned into Voronoi polygons using `d3.geoVoronoi`. The orthographic projection, rendered via `d3.geoPath`, displays the colored cells with dark borders and white site markers. A gentle animation rotates the projection continuously by updating the projection’s rotation, redrawing all paths every 50 milliseconds. The example uses `d3.geoOrthographic`, `d3.range`, and `d3.schemeCategory10` for colors, with SVG output.

PPhilippe Rivière

84% match

Loading thumbnail…

Urquhart graph

This visualization demonstrates the Urquhart graph, a subset of the Delaunay triangulation, applied to 2,000 randomly generated points. The graph edges are drawn in red over the Voronoi diagram’s gray polygon boundaries. The code uses `d3.voronoi` to compute the Voronoi cells, links, and triangles, then removes the longest edge from each triangle to derive the Urquhart graph. Sites are rendered as black-stroked circles, with SVG paths and lines for the polygons and edges.

PPhilippe Rivière

82% match

Loading thumbnail…

geoVoronoi mesh()

This example shows a dynamic Voronoi diagram on a globe, with a mesh of cell boundaries overlaid on a rotating orthographic projection. It generates 100 random geographic points, computes their spherical Voronoi tessellation using the `d3.geoVoronoi` plugin, and renders the resulting polygons and sites as SVG paths via `d3.geoPath`. The animation uses `d3.interval` to rotate the projection over time, continuously redrawing all paths. The code relies on D3 v4, the d3-delaunay library, and custom geo-Voronoi logic, with a light beige sphere and dark gray mesh for contrast.

PPhilippe Rivière

82% match

Loading thumbnail…

geoVoronoi.find(x,y)

A spherical Voronoi diagram of 500 random points is shown on an orthographic projection of the globe, where moving the mouse highlights the cell containing the cursor’s location. Using d3-geo-voronoi and d3.geoPath, the example implements a custom `xfind` method that walks through neighboring cells—coloring each visited cell in amber—to locate the nearest site, then marks the final cell red. Random site coordinates are generated directly in the code.

PPhilippe Rivière

79% match

Loading thumbnail…

Voronoi Tessellation

This interactive Voronoi diagram shows how a set of one hundred random points partitions a 960-by-500 SVG canvas into polygonal cells. Moving the mouse repositions the first site, causing the diagram to recompute dynamically with the red polygon, black links, and white site markers updating in real time. Built with D3 v4 and the d3-voronoi library, the example renders polygons as SVG paths, links as lines, and sites as circles, with all geometry recalculated on each mouse move.

Mmbostock

78% match

Loading thumbnail…

Fibonacci sphere surface distortion

A Fibonacci sphere algorithm distributes 60 points across a globe, and d3.geoVoronoi computes their spherical Voronoi cells. Each polygon is filled with a color mapped by d3.scaleLinear from its area, transitioning from blue through white to red as cell size increases. The SVG is rendered using d3.geoPath with an equirectangular projection, showing the distortion of the quasi-random lattice across the sphere’s surface. The code relies on d3.v4 and the d3-geo-voronoi library.

PPhilippe Rivière

75% match