Drawing and Automatic Generation of Graphs for Mason's Marks

This online tool draws and randomly produces straight-line graphs from a vertex-centric representation using node constraints with half-lines (see paper). This tool is written in Constraint Handling Rules (CHR) and SWI Prolog.

The input random produces a random graph that is supposed to be a stonemason's mark. It is derived from the mason's mark database for the Ulm Minster built into this program.

If the node constraints are geometrically inconsistent, no solution is produced. Then try again.

Sample Inputs


This software, all outputs and graph drawings are subject to Copyright by Thom Fruehwirth, Ulm University, 2018.