Algorithms for Drawing Media
Data Structures and Algorithms
2007-05-23 v1 Computational Geometry
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.
Cite
@article{arxiv.cs/0406020,
title = {Algorithms for Drawing Media},
author = {David Eppstein},
journal= {arXiv preprint arXiv:cs/0406020},
year = {2007}
}
Comments
13 pages, 11 figures