Skip to main content
SpringerLink
Log in

2-Layer Right Angle Crossing Drawings

  • Conference paper
Combinatorial Algorithms (IWOCA 2011)

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

Included in the following conference series:

Abstract

A 2-layer drawing represents a bipartite graph so that the vertices of each partition set are points of a distinct horizontal line (called a layer) and the edges are straight-line segments. In this paper we study 2-layer drawings where all edge crossings form right angles. We characterize which graphs admit this type of drawing, provide linear-time testing and embedding algorithms, and present a polynomial-time crossing minimization technique. Also, for a given graph G and a constant k, we prove that it is \(\mathcal{NP}\)-complete to decide whether G contains a subgraph of at least k edges having a 2-layer drawing with right angle crossings.

Work supported in part by MIUR of Italy under project AlgoDEEP prot. 2008TFBWL4.

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. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall (1993)

    Google Scholar 

  2. Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. Journal of Graph Algorithms and Applications 15(1), 53–78 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Argyriou, E.N., Bekos, M.A., Symvonis, A.: The Straight-Line RAC Drawing Problem is NP-Hard. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 74–85. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Didimo, W., Eades, P., Liotta, G.: Drawing Graphs with Right Angle Crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 206–217. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Didimo, W., Eades, P., Liotta, G.: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16), 687–691 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dujmović, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to 2-layer planarization. Algorithmica 45(2), 159–182 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dujmović, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory, CATS 2010, vol. 109, pp. 19–24. Australian Computer Society, Inc. (2010)

    Google Scholar 

  8. Dujmović, V., Whitesides, S.: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica 40(1), 15–31 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Eades, P., Kelly, D.: Heuristics for drawing 2-layered networks. Ars Comb. 21, 89–98 (1986)

    MathSciNet  MATH  Google Scholar 

  10. Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. In: EuroCG (2011)

    Google Scholar 

  11. Eades, P., McKay, B., Wormald, N.: On an edge crossing problem. In: Proc. of 9th Australian Computer Science Conference, pp. 327–334 (1986)

    Google Scholar 

  12. Eades, P., Whitesides, S.: Drawing graphs in two layers. Theoretical Computer Science 131(2), 361–374 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  13. Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379–403 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Mathematica 1, 203–209 (1972)

    MathSciNet  MATH  Google Scholar 

  15. Huang, W.: Using eye tracking to investigate graph layout effects. In: APVIS, pp. 97–100 (2007)

    Google Scholar 

  16. Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41–46 (2008)

    Google Scholar 

  17. Jünger, M., Mutzel, P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1 (1997)

    Google Scholar 

  18. Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM J. on Optimization 11(4), 1065–1080 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  19. Tomii, N., Kambayashi, Y., Yajima, S.: On planarization algorithms of 2-level graphs. Technical Report EC77-38, Inst. of Elect. and Comm. Eng. Japan (1977)

    Google Scholar 

  20. Valls, V., Martí, R., Lino, P.: A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs. Europ. J. of Oper. Res. 90(2), 303–319 (1996)

    Article  MATH  Google Scholar 

  21. van Kreveld, M.: The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 371–376. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università di Perugia, Italy

    Emilio Di Giacomo, Walter Didimo & Giuseppe Liotta

  2. University of Sydney, Australia

    Peter Eades

Authors
  1. Emilio Di Giacomo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Didimo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Eades
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Giuseppe Liotta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Digital Ecosystems & Business Intelligence Institute, Curtin University, Perth, Australia

    Costas S. Iliopoulos

  2. Department of Computing and Software Information Technology Building, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Giacomo, E., Didimo, W., Eades, P., Liotta, G. (2011). 2-Layer Right Angle Crossing Drawings. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2011. Lecture Notes in Computer Science, vol 7056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25011-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25011-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25010-1

  • Online ISBN: 978-3-642-25011-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation