Skip to content
/ compgeo Public

doubly-connected edge list structure and voronoi diagram algorithm

Notifications You must be signed in to change notification settings

jvorob/compgeo

Repository files navigation

Computational geometric algorithms circa 2019

Convex Hull: Finds convex hull of a set of points using the gift-wrapping algorithm

Voronoi: Implements a doubly-connected edge-list data structure. Uses it to implement an interactive voronoi diagram (click to add a new vor. site)

Image of voronoi diagram

Instructions: Requires node Tested and working with node version >= 6

npm install
nmp run serve : starts an interactive test server

npm run test : runs tests

There's constants scattered throughout the code as well //TODO: document those

About

doubly-connected edge list structure and voronoi diagram algorithm

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages