Upright-quad drawing of st-planar learning spaces

Authors:
David Eppstein
Affiliations:
Computer Science Department, University of California, Irvine
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 7
Cited 0

Area requirement and symmetry display of planar upward drawings

Discrete & Computational Geometry
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Knowledge Spaces

Knowledge Spaces
The lattice dimension of a graph

European Journal of Combinatorics
Media theory: Representations and examples

Discrete Applied Mathematics
Delta-confluent drawings

GD'05 Proceedings of the 13th international conference on Graph Drawing
Algorithms for drawing media

GD'04 Proceedings of the 12th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from antimatroids and used to model states of knowledge of students. We show how to draw any st-planar learning space so all internal faces are convex quadrilaterals with the bottom side horizontal and the left side vertical, with one minimal and one maximal vertex. Conversely, every such drawing represents an st-planar learning space. We also describe connections between these graphs and arrangements of translates of a quadrant.