Generating Dimers

This is an implementation of the algorithm described in this paper.
Given a Newton polygon it generates dimer models whose Jacobi algebra
is a noncommutative crepant resolution of the corresponding gorenstein singularity.
E.g. The unit square gives rise to the conifold dimer.

Each dimer is drawn as a quiver and a fish tiling on a torus.
If you enter a stability condition as a square bracketed list of numbers, one for each vertex and summing to 0.
Then program will calculate the moduli space of stable representations with dimension vector [1,..,1]

Draw a Newton polygon


Canvas not supported.
Hyperplanes:

Maximum dimers:


Dimer models for the polygon
[[0,0,1],[1,0,1],[1,1,1],[0,1,1]]
There is 1 dimer:

Points: [ [ 0, 0 ], [ 1/2, 1/2 ] ]
Arrows:
[ [ 1, 2, [ -1/2, 1/2 ] ], [ 1, 2, [ 1/2, -1/2 ] ], [ 2, 1, [ -1/2, -1/2 ] ],
[ 2, 1, [ 1/2, 1/2 ] ] ]

theta:




Link to the complete information