Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
Area requirement of visibility representations of trees
Information Processing Letters
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
ACM Transactions on Graphics (TOG)
Directed VR-Representable Graphs have Unbounded Dimension
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Cascaded treemaps: examining the visibility and stability of structure in treemaps
GI '08 Proceedings of graphics interface 2008
Hi-index | 0.00 |
DAGmaps are space filling visualizations of DAGs that generalize treemaps. Deciding whether or not a DAG admits a DAGmap is NP-complete. Recently we defined a special case called one-dimensional DAGmap where the admissibility is decided in linear time. However there is no complete characterization of the class of DAGs that admit a one-dimensional DAGmap. In this paper we prove that a DAG admits a one-dimensional DAGmap if and only if it admits a directed ε-visibility representation. Then we give a characterization of the DAGs that admit directed ε-visibility representations. Finally we show that a DAGmap defines a directed three-dimensional ε-visibility representation of a DAG.