Python-based implementation of the Discrete Voronoi Chain tessellation algorithm, originally introduced by Velic, May and Moresi (2009).
-
Updated
May 23, 2024 - Python
Python-based implementation of the Discrete Voronoi Chain tessellation algorithm, originally introduced by Velic, May and Moresi (2009).
Python implementation of Steven Fortune's sweep line algorithm for voronoi graph computation
A simulation of crystal growth by voronoi diagrams with polygonal growing seeds
Generate a Voronoi diagram from a Delaunay triangulation and use a variant of Growing Tree to (a)maze
Add a description, image, and links to the voronoi-generator topic page so that developers can more easily learn about it.
To associate your repository with the voronoi-generator topic, visit your repo's landing page and select "manage topics."