Algorithms for Drawing Media

TL;DR

This paper presents algorithms for visualizing media systems with state transition graphs, utilizing lattice embeddings and planar graph drawings to produce clear, symmetric representations.

Contribution

It introduces novel algorithms for drawing media based on lattice embeddings and planar graph projections, enhancing visualization of state transition systems.

Findings

Effective algorithms for media visualization

Lattice embedding and planar projection techniques

Improved clarity in media state diagrams

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.