Skip to main content
SpringerLink
Log in

Algorithms for Removing Node Overlaps with Some Basis Nodes

  • Conference paper
  • First Online:
Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2015

Part of the book series: Studies in Computational Intelligence ((SCI,volume 612))

Abstract

Graphs are used to represent various types of structures. When the nodes of a graph are drawn by non-zero sized graphical features, it is important to avoid node overlaps. We propose three heuristic algorithms to remove node overlaps in graphs with several tens of nodes by refining a previously proposed algorithm, i.e., the force-transfer algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149–160 (1984)

    MathSciNet  Google Scholar 

  2. Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31, 7–15 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991)

    Article  Google Scholar 

  4. Sumi, K., Tanaka, H., Ebara, H., Nakano, H.: Performance evaluations of graph drawing algorithms (in Japanese). IEICE Trans. Fund. Electron. Commun. Comput. Sci. J79-A(3), 680-686 (1996)

    Google Scholar 

  5. Kawanishi, K., Masuda, S., Yamaguchi, K.: An improvement of Eades’ graph drawing algorithm with two kinds of desirable distances (in Japanese). IEICE Trans. Fund. Electron. Commun. Comput. Sci. J83-A(9), 1117-1121 (2000)

    Google Scholar 

  6. Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6, 183–210 (1995)

    Article  Google Scholar 

  7. Hayashi, K., Inoue, M., Masuzawa, T., Fujiwara, H.: A layout adjustment problem for disjoint rectangles preserving orthogonal order (in Japanese). IEICE Trans. Fund. Electron. Commun. Comput. Sci. J82-D-I(6), 679-690 (1999)

    Google Scholar 

  8. Huang, X., Lai, W., Sajeev, A.S.M., Gao, J.: A new algorithm for removing node overlapping in graph visualization. Inf. Sci. 177, 2821–2844 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lyons, K.A., Meijer, H., Rappaport, D.: Algorithms for cluster busting in anchored graph drawing. J. Graph Alg. Appl. 2(1), 1–24 (1998)

    Article  MathSciNet  Google Scholar 

  10. Gansner, E.R., Hu, Y.: Efficient node overlap removal using proximity stress model. In: Proceedings of the 16th International Symposium on Graph Drawing (GD 2008). Lecture Notes in Computer Science, vol. 5417, pp. 206-217. Springer, Berlin (2009)

    Google Scholar 

  11. Marriott, K., Stuckey, P., Tam, V., He, W.: Removing node overlapping in graph layout using constrained optimization. Constraints 8(2), 143–171 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. T. Dwyer, K. Marriott, P.J. Stuckey: Fast node overlap removal. In: Proceedings of the 13th International Symposium on Graph Drawing (GD 2005). Lecture Notes in Computer Science, vol. 3843, pp. 153-164. Springer, Berlin (2005)

    Google Scholar 

  13. Lai, W., Eades, P.: Removing edge-node intersections in drawings of graphs. Inf. Process. Lett. 81, 105–110 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Abe, N., Masuda, S., Yamaguchi, K.: An algorithm for finding a graph drawing with all vertex labels (in Japanese). IEICE Trans. Fund. Electron. Commun. Comput. Sci J95-A(8), 669-682 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information and Communication Engineering, Osaka Electro-Communication University, 18-8 Hatsu-cho, Neyagawa-shi, Osaka-fu, 572–8530, Japan

    Noboru Abe, Hiroaki Oh & Kouhei Inoue

Authors
  1. Noboru Abe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroaki Oh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kouhei Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Noboru Abe .

Editor information

Editors and Affiliations

  1. Software Engineering and Information Technology Institute, Central Michigan University, Mount Pleasant, Michigan, USA

    Roger Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Abe, N., Oh, H., Inoue, K. (2016). Algorithms for Removing Node Overlaps with Some Basis Nodes. In: Lee, R. (eds) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2015. Studies in Computational Intelligence, vol 612. Springer, Cham. https://doi.org/10.1007/978-3-319-23509-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23509-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23508-0

  • Online ISBN: 978-3-319-23509-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation