hasufell
c8914c8272
Get predecessors and successors in the beginning instead of figuring them out for every single point separetely. This is still O(n), butt should be a lot quicker than the previous approach.
Random computer graphics algorithms visualized with the Diagrams library
Building
cabal build (you need cabal)
Running
cabal run Gtk -- file.obj
or
cabal run Gif -- -w 600 -h 600 -o out.gif
Build Status
