Animation of the Neandertal algorithm

Play with the red and green points.

This is a (CPU based) simulation of the main algorithm. It constructucts a discrete approximation of a conformal map between two triangles. One of the triangels may be chosen to be hyperbolic. The algorithm has been desiberately slowed down by letting it run on the CPU on a sparse grid.