While a visual unconstrained tree structure planar layout design is easy to implement, a visualization of a tree with constraints on node ranks and their ordering within ranks leads to a difficult combinatorial problem. A genealogical graph can be taken as an example of such a case. We propose a new method of tree-driven graph node layout.
展开▼
