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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Eppstein, D. (2004). Algorithms for drawing media. In Lecture Notes in Computer Science (Vol. 3383, pp. 173–183). https://doi.org/10.1007/978-3-540-31843-9_19
Mendeley helps you to discover research relevant for your work.