Automated Lattice Drawing

Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they now play an important role in both pure lattice theory and in data representation. Now that lattices can be created by software, it is important to have software that can automatically draw them. This paper covers: – The role and history of the diagram. – What constitutes a good diagram. – Algorithms to produce good diagrams. Recent work on software incorporating these algorithms into a drawing program will also be covered. An ordered set P = (P, ≤) consists of a set P and a partial order relation ≤ on P. That is, the relation ≤ is reflexive (x ≤ x), transitive (x ≤ y and y ≤ z imply x ≤ z) and antisymmetric (x ≤ y and y ≤ x imply x = y). If P is finite there is a unique smallest relation , known as the cover or neighbor relation, whose transitive, reflexive closure is ≤. (Graph the...

• Type: Conference
• Year: 2004
• Where: ICFCA
• Authors: Ralph Freese
• Keywords: Formal Languages, Hasse Diagram, ICFCA 2004, Lattice Theory, Ordered Sets