Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs

@inproceedings{Lin1999AreaMF,
  title={Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs},
  author={Xuemin Lin and Peter Eades},
  booktitle={COCOON},
  year={1999}
}
Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate the computational complexity of constructing minimum area grid visibility representations of hierarchically planar graphs. Firstly, we provide a quadratic algorithm that minimizes the drawing area with respect to a fixed planar embedding. This implies that the area minimization problem is polynomial time solvable restricted to… 
Area bounds of hierarchical graphs straightline grid drawing
TLDR
This paper applies practical analysis in order to find the relation between the grid drawing area of a hierarchical graph and its number of vertices and introduces two new mathematical formulations for the minimum and maximum grid drawing areas hierarchical graph.
Planarity Based Algorithms for Minor Embedding in Grid Graphs
TLDR
This work presents two heuristic algorithms for minor embedding planar graphs in grid graphs, and provides an experimental evaluation of one.
Visibility Drawings of Plane 3-Trees with Minimum Area
TLDR
A polynomial-time algorithm is given to obtain minimum-area visibility drawings of plane 3-trees and shows that the problem can be solved for a fixed planar embedding of a hierarchically planar graph in quadratic time.
Circle planarity of level graphs
TLDR
The main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing, which use and generalise PQ-trees, which are a data structure for efficient planarity tests.
Fast and Simple Horizontal Coordinate Assignment
We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to implement and compares well

References

SHOWING 1-10 OF 20 REFERENCES
Area Requirements for Drawing Hierarchically Planar Graphs
TLDR
This paper investigates area requirements for drawing s-t hierarchically planar graphs by straight-lines and presents another grid visibility drawing algorithm which is efficient and guarantees the minimum drawing area.
An Algorithm for Drawing a Hierarchical Graph
TLDR
The Degree Weighted Barycentre (DWB) algorithm for drawing hierarchical graphs is introduced and it is shown that drawings output by DWB satisfy several important aesthetic criteria: under certain connectivity conditions, they are planar, convex, and symmetric whenever such drawings are possible.
On Embedding a Graph in the Grid with the Minimum Number of Bends
  • R. Tamassia
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1987
TLDR
An algorithm is presented that computes a region preserving grid embedding with the minimum number of bends in edges with use of network flow techniques, and runs in time $O(n^2 \log n)$, where n is the number of vertices of the graph.
Hierarchies and planarity theory
TLDR
An efficient algorithm for testing if a hierarchy is planar (i.e. if it can be drawn without edge crossings) is proposed and a complete combinatorial characterization of the class of planar hierarchies is given.
Algorithms for Plane Representations of Acyclic Digraphs
Area requirement and symmetry display of planar upward drawings
TLDR
A linear-time algorithm is presented that produces drawings of planar acyclic digraphs with a small number of bends, asymptotically optimal area, and such that symmetries and isomorphisms of the digraph are displayed.
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
TLDR
This paper shows that upward planarity testing and rectilinear planar testing are NP-complete problems, and shows that it is NP-hard to approximate the minimum number of bends in a planar orthogonal drawing of an n-vertex graph with an O(n1−∈) error.
On the Computational Complexity of Upward and Rectilinear Planarity Testing
TLDR
It is shown that upward planarity testing and rectilinear planar testing are NP-complete problems and that it is NP-hard to approximate the minimum number of bends in a planar orthogonal drawing of an n-vertex graph with an $O(n^{1-\epsilon})$ error for any $\ep silon > 0$.
On-Line Planarity Testing
TLDR
An efficient technique for on-line planarity testing of a graph is presented that uses O(n) space and supports tests and insertions of vertices and edges in O(\log n) time, where n is the current number of Vertices of G.
...
...