Delaunay & Voronoi
This interactive simulator explores Delaunay & Voronoi in Math Visualization. Bowyer–Watson triangulation and dual Voronoi tessellation; click to add seeds, drag to move. Use the controls to change the scenario; watch the visualization and any graphs or readouts to connect the model with lectures, labs, and homework.
Who it's for: Best once you already know the basic definitions and want to build intuition. Typical context: Math Visualization.
Key terms
- delaunay
- voronoi
- delaunay voronoi
- math
- visualization
How it works
The **Voronoi diagram** of N seeds partitions the plane into cells of points **closer to seed i than to any other**. Its **dual graph** is the **Delaunay triangulation**: connect two seeds whenever their Voronoi cells share an edge. Delaunay maximises the **minimum angle** of all triangles (no other triangulation does as well) and has the **empty-circumcircle property** — toggle the option to verify that **no other seed lies inside any circumcircle**. Implemented with the **Bowyer–Watson** incremental algorithm.
Key equations
More from Math Visualization
Other simulators in this category — or see all 42.
Physarum Slime (Agents)
~4500 agents follow a deposited chemoattractant: deposit + diffusion + decay + 3-sensor steering grow path networks.
Savitzky–Golay Smoothing
Noisy cosine vs SG(7,2) convolution — preserves peaks better than a wide boxcar.
Markov Chain (Weather)
Sun/Rain two-state chain: P matrix, stationary π, empirical vs theory.
Gradient Descent (2D)
Level sets of f(x,y) and path (x,y) ← (x,y) − η∇f; bowl or elliptic well.
Minkowski Diagram
Light cone and boosted axes in 1+1D; γ from v.
Twin Paradox
Out-and-back worldlines; proper time τ = T/γ vs Earth time T.