Algorithms for Drawing Media

Eppstein, David (2004) Algorithms for Drawing Media. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 173-183(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_19).

Full text not available from this repository.

Abstract

We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two principles: embedding the state transition graph in a low-dimensional integer lattice and projecting the lattice onto the plane, or drawing the medium as a planar graph with centrally symmetric faces.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-31843-9_19
Classifications: P Styles > P.780 Symmetric
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/584

Actions (login required)

View Item View Item