Algorithms for Drawing Media

Simple item page
dc.creatorEppstein, David
dc.date2004-06-16
dc.date.accessioned2026-07-07T03:21:26Z
dc.date.available2026-07-07T03:21:26Z
dc.descriptionWe 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.
dc.description13 pages, 11 figures
dc.identifierhttps://arxiv.org/abs/cs/0406020
dc.identifierhttp://arxiv.org/abs/cs/0406020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32195
dc.subjectData Structures and Algorithms
dc.subjectComputational Geometry
dc.subjectF.2.2; G.2.2
dc.titleAlgorithms for Drawing Media
dc.typetext

Files

Collections

arXiv