On the complexity of orthogonal compaction

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

Volumn 1663, Issue , 1999, Pages 56-61

  Patrignani, Maurizio ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

EDGE LENGTH; GRAPH DRAWING; NP COMPLETE; NP-HARD; OPTIMIZATION PROBLEMS; ORTHOGONAL GRID DRAWINGS; ORTHOGONAL REPRESENTATION; SEGMENT LENGTHS;

DATA STRUCTURES;

EID: 84948993634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_7     Document Type: Conference Paper

References (15)

1. P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In F. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia, editors, Proc. 5th Workshop Algorithms Data Struct., volume 1272 of LNCS, pages 331-344. Springer-Verlag, 1997.
2. S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vis-Mara. Optimal compaction of orthogonal representations. In CGC Workshop on Geometric Computing, 1998.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
4. D. Dolev and H. Tïickey. On linear area embedding of planar graphs, report cs-81-876, Stanford Univ., 1981.
5. U. Föβmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of LNCS, pages 254-266. Springer-Verlag, 1996.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
7. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.
8. F. Hoffmann and K. Kriegel. Embedding rectilinear graphs in linear time. Inform. Process. Lett., 29:75-79, 1988.
9. G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planax graphs. Technical Report MPI-I-98-1-013, Max Planck Institut für Informatik, Saarbrücken, Germany, 1998.
10. G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. Cornuejols, R. E. Burkard, and G. J. Woeginger, editors, Integer Progr. Comb. Opt. (Proc. IPCO '99), volume 1610 of LNCS, Springer-Verlag, to appear.
11. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout Wiley-Teubner, 1990.
12. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
13. M. Patrignani. On the complexity of orthogonal compaction. Technical Report RT-DIA-39-99, Dipartimento di Informatica e Automazione, Università di Roma Tre, Rome, Italy, Jan. 1999.
14. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.
15. G. Vijayan and A. Wigderson. Rectilinear graphs and their embeddings. SIAM J. Comput., 14:355-372, 1985.