An algorithm is presented to draw Hasse-diagrams of partially ordered sets (orders). It uses two heuristic principles to generate `good' pictures for a wide range of orders. These two principles are (i) The total length of all edges of the diagram should be small (with the vertices kept at a minimal distance) and (ii) the vertices are constrained to coincide with the grid points of a given rectangular planar grid. The benefits are quite straightforward sine (i) using less ink means less confusion and (ii) the restriction to grid points tends to keep the number of different slopes small. Since the program was conceived as a readily usable tool (with the emphasis on results rather than on perfection), we are well aware of the fact that it will lend itself easily to improvements in many aspects.

Links and resources

BibTeX key:
search on:

Comments and Reviews  

There is no review or comment yet. You can write one!


Cite this publication