voronoi

Fast Portable Noise Library - C# C++ C Java HLSL GLSL JavaScript Rust Go

A nice and fast way to construct 2D Voronoi Diagrams

gRPC blender-addon written in Rust

Blender add-on written in Rust

This rust library generates Voronoi-tessellated sphere meshes for procedural planet generation.

Rust implementation of Fortune's algorithm for generating Voronoi diagrams

A Bevy Procedural Slum Generator

A port in of d3-geo-voronoi into rust.

Safe Rust Qhull bindings

A Godot 4 GDExtension that provides a VoronoiPlanetNode for generating procedural Voronoi-tessellated planet meshes.

FastNoiseLite written in Rust

Voronoi colored faces using efficient nearest neighbour search instead of graph math

Bayesian additive Voronoi tessellations (AddiVortes): Rust core with Python and R packages

Voronoi Diagrams are a Fundamental Mathematics and Computational Geometry Structure that Partitions Planes into Regions based on Proximity to a Set of Given Points (Sites / Generators). Using the Dual Graph of the Delaunay Triangulation (DT) as Circumcenters—Basing the Bowyer-Watson Algorithm to Compute the DT First

A small command line utility to convert a 2-dimensional input point set to finite Voronoi cells that are bound by an input polygon.

Computational Geometry examples, some algorithms implementations, to learn Rust

Incremental Delaunay triangulation + Voronoi dual in the browser (Rust → WASM). Point-cloud lab, not polygon triangulation.

Voronoi algorithm libraries and demo applications in Rust — CVT, NN search, pathfinding, stippling, texture synthesis, treemaps, and visualizations.

A simple, inefficient, cpu-based voronoi diagram generator.

Interactive 2D/3D clustering visualizer in Rust featuring k-means, Voronoi partitioning, PCA projection, and WebAssembly support.