70ce5ca5118b6530185b102784492fe97ddb4bfa
We had to add NoFace/NoEdge/NoVert constructors to our half-edge data structures, because using "Maybe HeEdge a" as the result value of 'indirectToDirect' causes an infinite recursion, since the whole data structure (which is cyclic and infinite) has to be evaluated in order to know which constructor to use. Unfortunately this makes the code quite hard to read. TODO: add pseudo-code
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
Languages
Haskell
91.5%
Cabal Config
6.1%
Wavefront Object
2.4%
