/voronoi

Golang package for generation of voronoi diagrams with Fortune's algorithm

Primary LanguageGoMIT LicenseMIT

voronoi

Golang package for generation of voronoi diagrams with Fortune's algorithm.

Work in progress. Populates a DCEL data structure, but does not connect infinite half-edges to the bounding box.

TODO:

  • Connect infinite half-edges to the bounding box.

How to debug

cd cmd
go run player.go

player is a standalone tool (standalone web server) for visualization of the algorithm of github.com/quasoft/voronoi in steps:

Screenshot of the player tool

Pressing the [Next] link advances the algorithm to the next event and updates the visualization at the left.

The graph at the right reflects the state of the binary tree with parabola arcs.