Skip to main content
SpringerLink
Log in

On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features

  • Conference paper
Fun with Algorithms (FUN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4475))

Included in the following conference series:

  • 1047 Accesses

Abstract

Graph Drawing is (usually) concerned with the production of readable representations of graphs. In this paper, instead of investigating how to produce “good” drawings, we tackle the opposite problem of producing “bad” drawings. In particular, we study how to construct orthogonal drawings with many bends along the edges and with large area. Our results show surprising contact points, in Graph Drawing, between the computational cost of niceness and the one of ugliness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput. 27(6), 1764–1811 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. In: Dehne, F., Rau-Chaplin, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 331–344. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Bridgeman, S.S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L.: Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry 16, 53–93 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete & Computational Geometry 23(2), 191–206 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing, Upper Saddle River, NJ. Prentice-Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

  6. Fößmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254–266. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  7. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lovász, L., Pach, J., Szegedy, M.: On Conway’s thrackle conjecture. In: Symposium on Computational Geometry, pp. 147–151 (1995)

    Google Scholar 

  9. Nakano, S.-I., Yoshikawa, M.: A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs. In: Marks, J. (ed.) Graph Drawing 2000. LNCS, vol. 1984, pp. 296–307. Springer, Heidelberg (2000)

    Google Scholar 

  10. Patrignani, M.: On the complexity of orthogonal compaction. Comput. Geom. 19(1), 47–67 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Rahman, M.S., Nakano, S.-I., Nishizeki, T.: A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. J. Graph Algorithms Appl. 3(4), 31–62 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Tamassia, R.: New layout techniques for entity-relationship diagrams. In: Proc. 4th Internat. Conf. on Entity-Relationship Approach, pp. 304–311 (1985)

    Google Scholar 

  13. Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421–444 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man. Cybern. SMC-18(1), 61–79 (1988)

    Article  Google Scholar 

  15. Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Trans. Circuits Syst. CAS-36(9), 1230–1234 (1989)

    Article  MathSciNet  Google Scholar 

  16. Tamassia, R., Tollis, I.G., Vitter, J.S.: Lower bounds and parallel algorithms for planar orthogonal grid drawings. In: Proc. IEEE Symposium on Parallel and Distributed Processing, pp. 386–393. IEEE Computer Society Press, Los Alamitos (1991)

    Chapter  Google Scholar 

  17. Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM J. Comput. 14, 355–372 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Automazione – Università di Roma Tre, Italy

    Giuseppe Di Battista, Fabrizio Frati & Maurizio Patrignani

Authors
  1. Giuseppe Di Battista
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabrizio Frati
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maurizio Patrignani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Viale Morgagni 65, 50134, Firenze, Italy

    Pierluigi Crescenzi

  2. Dipartimento di Informatica, Università degli Studi di Pisa, Largo Bruno Pontecorvo 3, 56127, Pisa, Italy

    Giuseppe Prencipe

  3. Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Padova, Via Gradenigo 6/B, 35131, Padova, Italy

    Geppino Pucci

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Di Battista, G., Frati, F., Patrignani, M. (2007). On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds) Fun with Algorithms. FUN 2007. Lecture Notes in Computer Science, vol 4475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72914-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72914-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72913-6

  • Online ISBN: 978-3-540-72914-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation