Algorithms for drawing media

Authors:
David Eppstein
Affiliations:
Computer Science Department, School of Information & Computer Science, University of California, Irvine
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 7
Cited 4

The complexity of minimizing wire lengths in VLSI layouts

Information Processing Letters
On the complexity of recognizing Hamming graphs and related classes of graphs

European Journal of Combinatorics - Special issue on discrete metric spaces
Sampling with Hammersley and Halton points

Journal of Graphics Tools
Media theory

Discrete Applied Mathematics
The lattice dimension of a graph

European Journal of Combinatorics
Incremental planarity testing

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
The SPQR-tree data structure in graph drawing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Recognizing partial cubes in quadratic time

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for media

Discrete Applied Mathematics
Isometric Diamond Subgraphs

Graph Drawing
Upright-quad drawing of st-planar learning spaces

GD'06 Proceedings of the 14th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

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.