A layout adjustment problem for disjoint rectangles preserving orthogonal order

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1547, Issue , 1999, Pages 183-197

  Hayashi, Kunihiko ^a   Inoue, Michiko ^a   Masuzawa, Toshimitsu ^a   Fujiwara, Hideo ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957868162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_14     Document Type: Conference Paper

References (6)

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, “Algorithms for drawing graphs: an annotated bibliography,” Computational Geometry Theory and Applications, vol. 4, pp. 235-282, 1994.
2. R. Tamassia, G. Di Battista, and C. Batini, “Automatic graph drawing and readability of diagrams,” IEEE Trans. on System, Man and Cybernetics, vol. 18, no. 1, pp. 61-79, 1988.
3. P. Eades, W. Lai, K. Misue, and K. Sugiyama, “Preserving the mental map of a diagram,” Proc. of COMPUGRAPHICS '91, pp. 34-43, 1991.
4. K. Misue, P. Eades, W. Lai, and K. Sugiyama, “Layout adjustment and the mental map,” Journal of Visual Languages and Computing, vol. 6, pp. 183-210, 1995.
5. M-A. D. Storey and H. A. Müller,”Graph layout adjustment strategies,” Proc. Graph Drawing '95, LNCS 1027, pp. 487-499. Springer-Verlag, 1995.
6. M. R. Garey and D. S. Johnson, “Computers and Intractability — A Guide to the Theory of NP-Completeness,” W. H. Freeman and Company, New York, 1979.