Poisson-Disc IV

100%

Poisson-Disc IV

✓ Published0🌍 Public

Last edited Feb 9, 2016

Created on Jun 15, 2014

This example generates a set of points using a Poisson-disc sampling algorithm and renders them as a clipped Voronoi diagram. The SVG paths are filled with a color mapped from each polygon’s area using a cubehelix color scale, creating a smooth gradient across the canvas. The code uses d3.geom.voronoi for the diagram, d3.scale.cubehelix for coloring, and d3.svg for rendering. The Poisson-disc sampler is based on Jason Davies’ implementation, with a fixed radius of 5.68 pixels.

AI-generated description

gpl-3.0 Licensed

Similar vizzes

Loading thumbnail…

Poisson-Disc

Poisson-Disc uses d3.timer to progressively render a two-dimensional Poisson-disc sampling of 960 by 500 pixels. The animation reveals the algorithm’s output by appending SVG circles that transition their radius from zero to two pixels. The code implements Bridson’s algorithm, based on Jason Davies’ version, which generates evenly distributed random samples without clustering. Each new point is rejected if it falls within a minimum distance (radius 10) of existing points, producing a blue-noise pattern across the canvas.

Mmbostock

85% match

Loading thumbnail…

Poisson-Disc

The visualization shows a square canvas being progressively filled with small circles using Poisson-disc sampling, a method for generating evenly distributed random points. The algorithm, based on Bridson’s technique, ensures each new point is at least a specified distance from existing ones, creating a uniform, pseudo-random pattern. Built with d3.v3, the animation adds circles one at a time via `d3.timer`, with each circle’s radius animated using `transition()`. The code explicitly implements the sampling logic, including a grid-based spatial index for efficient distance checks, and renders the result as SVG circles.

JJaapSuter

83% match

Loading thumbnail…

Poisson-Disc III

This visualization uses Poisson-disc sampling to place 10,000 points across Van Gogh’s *The Starry Night*, then renders each point as a Voronoi cell colored by the underlying image pixel. The code loads the painting into a Canvas, reads its pixel data via `getImageData`, and fills each cell with the sampled color. It relies on `d3.geom.voronoi` for the cell geometry and a custom `poissonDiscSampler` function to ensure even spacing between points. The output is a stippled, mosaic-like reinterpretation of the artwork, contrasting with uniform random sampling.

Mmbostock

82% match

Loading thumbnail…

Poisson-Disc II

This animation illustrates the Poisson-disc sampling algorithm, which generates a set of points with a minimum spacing. Red dots are active samples; one is selected randomly, and up to *k* candidate points (open black circles) are generated in an annulus around it. Candidates are rejected if too close to any existing sample, shown by a gray exclusion zone and black lines to the offending neighbor. Inactive samples turn black, and the process ends when none remain active. The code uses d3.svg.arc for the annulus and CSS transitions for animation.

Mmbostock

81% match

Loading thumbnail…

Poisson-Disc

This visualization demonstrates Poisson-disc sampling, a blue-noise distribution pattern that places icons evenly across a canvas while maintaining a minimum distance between them. Using Bridson’s algorithm, the d3.timer function adds 100 new samples per frame, each rendered as an SVG image element that animates from zero to its full size via the .transition() method. The code relies on d3.v4 for timer and transition APIs, with the poissonDiscSampler function handling spatial grid-based rejection sampling to ensure uniform coverage. The icons animate into place, illustrating the algorithm’s progressive point generation in real time.

LLuisSevillano

81% match

Loading thumbnail…

Poisson-Disc V

This animation visualizes Bridson’s Poisson-disc sampling algorithm by showing the branching process as new samples are added. Each time a sample is placed, a line animates outward from the neighboring sample that spawned it, revealing the algorithm’s growth tree. The code uses d3.v3 to append SVG line elements and applies staggered transitions with a delay based on each sample’s depth, making the generation order visible. The sampling itself follows Jason Davies’s implementation, generating random points with a minimum radius while rejecting candidates that are too close or outside the canvas.

Mmbostock

81% match

Loading thumbnail…

Uniform Random III

This example generates 10,000 random points within a fixed width and height, then computes their Voronoi diagram using `d3.geom.voronoi` with a clip extent matching the SVG canvas. Each Voronoi cell is rendered as an SVG path, filled with a color from a cubehelix scale (`d3.scale.cubehelix`) that maps the cell’s polygon area to a hue range. The coloring transitions smoothly from bright green to deep purple as area increases, creating a visually textured mosaic. The code uses D3 v3, the custom cubehelix interpolation library, and random uniform sampling.

Mmbostock

78% match

Loading thumbnail…

Voronoi Test (N=2)

The example shows a Voronoi diagram computed from two fixed points, with each cell and its corresponding point circle filled using the same color from `d3.scale.category10()`. Using d3.v3 and SVG, the code applies `d3.geom.voronoi` to generate the cell polygons, then renders them as `path` elements with a hover effect that increases fill opacity. The circles are positioned via `transform` translations, and both layers receive black strokes from the shared CSS rule.

Mmbostock

74% match