Optimality and Complexity for Drawing Problems of Tree-Structured Diagrams

We investigated sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we presented efficient algorithms that provide narrower placement satisfying given amorphous conditions. In this paper we review our these previous results regarding with sets of constraints for tidily drawing TSDs, efficient algorithms which produce minimum width drawings of TSDs while satisfying certain constraints and NP-completeness of drawing problems of TSDs. Then we discuss the relation among constraints and the optimality with respect to the widths of drawing TSDs. Finally we indicate a key constraint which is not only for obtaining the optimality but also for the practical uses.

[1]  Bernd Becker,et al.  On the Optimal Layout of Planar Graphs with Fixed Boundary , 1987, SIAM J. Comput..

[2]  Tetsuro Nishino,et al.  O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams , 2012, 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

[3]  Takeo Yaku,et al.  A visual software development environment based on graph grammars , 2004, IASTED Conf. on Software Engineering.

[4]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[5]  Youzou Miyadera,et al.  A method of drawing tree-structured program diagrams on the Euclidian plane , 1993, Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93.

[6]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[7]  Edward M. Reingold,et al.  The complexity of drawing trees nicely , 2004, Acta Informatica.

[8]  Kensei Tsuchida.  The Complexity of Drawing Tree-Structured Diagrams , 1995, IEICE Trans. Inf. Syst..

[9]  Norishige Chiba,et al.  Drawing plane graphs nicely , 1985, Acta Informatica.

[10]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[11]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[12]  Takeo Yaku,et al.  An Attribute Graph Grammar Enabling Narrower Drawings of Trees , 2010, 2010 IEEE/ACIS 9th International Conference on Computer and Information Science.

[13]  Charles Wetherell,et al.  Tidy Drawings of Trees , 1979, IEEE Transactions on Software Engineering.

[14]  Tetsuro Nishino.  Attribute Graph Grammars with Applications to Hichart Program Chart Editors , 1990 .