Drawing orders using less ink
From MaRDI portal
The authors describe two heuristic principles in order to get a clear picture (Hasse-diagram) for finite partially ordered sets. This is done in such a way that the total length of all edges of the diagram should be short and the vertices are constrained to coincide with grid points (of a rectangular planar grid).
Recommendations
Cites work
- An Inductive Algorithm to Construct Finite Lattices
- Crooked diagrams with few slopes
- Einfluß und Kompensation von Lose und Coulombscher Reibung bei einem drehzahl- und lagegeregelten, elastischen Zweimassensystem
- scientific article; zbMATH DE number 4045807 (Why is no real title available?)
- scientific article; zbMATH DE number 3305808 (Why is no real title available?)
- scientific article; zbMATH DE number 3366941 (Why is no real title available?)
- Lattice diagrams with few slopes
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Orders with level diagrams
- The complexity of drawing trees nicely
- The complexity of minimizing wire lengths in VLSI layouts
Cited in
(4)
This page was built for publication: Drawing orders using less ink
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205151)