Algorithms for Drawing Media

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.

• Type: Conference
• Year: 2004
• Where: GD
• Authors: David Eppstein
• Keywords: GD 2004, Low-dimensional Integer Lattice, Partial Cubes, State Transition Graph