Skip to main content
SpringerLink
Log in

Hypergraph Drawing by Force-Directed Placement

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10439))

Included in the following conference series:

Abstract

We propose a family of algorithms that transform a hypergraph drawing problem into a graph drawing problem and leverage force-directed graph drawing algorithms in order to draw hypergraphs. We propose and discuss a number of criteria to evaluate the quality of the drawings from the points of view of aesthetics and of visualization and analytics. We empirically and comparatively evaluate the quality of the drawings based on these criteria on both synthetic and real data sets. Experiments reveal that the algorithms are generally effective and the drawings generated are aesthetically pleasing.

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 EPUB and 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

Notes

  1. 1.

    http://dblp.uni-trier.de/xml/.

References

  1. Alper, B., Riche, N., Ramos, G., Czerwinski, M.: Design study of linesets, a novel set visualization technique. IEEE Trans. Vis. Comput. Graph. 17(12), 2259–2267 (2011)

    Article  Google Scholar 

  2. Alsallakh, B., Micallef, L., Aigner, W., Hauser, H., Miksch, S., Rodgers, P.: Visualizing sets and set-typed data: State-of-the-art and future challenges. In: Eurographics conference on Visualization (EuroVis)-State of The Art Reports, pp. 1–21 (2014)

    Google Scholar 

  3. Arafat, N.A., Bressan, S.: Hypergraph drawing by force-directed placement. School of Computing, National University of Singapore, Technical report number TRC6/17 (2017). http://www.comp.nus.edu.sg/naheed/files/hypergraphdrawing.pdf

  4. Bertault, F., Eades, P.: Drawing hypergraphs in the subset standard (short demo paper). In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 164–169. Springer, Heidelberg (2001). doi:10.1007/3-540-44541-2_15

    Chapter  Google Scholar 

  5. Brinkmeier, M., Werner, J., Recknagel, S.: Communities in graphs and hypergraphs. In: Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management, pp. 869–872. ACM (2007)

    Google Scholar 

  6. Collins, C., Penn, G., Carpendale, S.: Bubble sets: revealing set relations with isocontours over existing visualizations. IEEE Trans. Vis. Comput. Graph. 15(6), 1009–1016 (2009)

    Article  Google Scholar 

  7. Dinkla, K., van Kreveld, M.J., Speckmann, B., Westenberg, M.A.: Kelp diagrams: point set membership visualization. In: Computer Graphics Forum, pp. 875–884. Wiley Online Library (2012)

    Google Scholar 

  8. Eschbach, T., Günther, W., Becker, B.: Orthogonal hypergraph drawing for improved visibility. J. Graph Algorithms Appl. 10(2), 141–157 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM (JACM) 30(3), 514–550 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Flower, J., Howse, J.: Generating Euler diagrams. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds.) Diagrams 2002. LNCS (LNAI), vol. 2317, pp. 61–75. Springer, Heidelberg (2002). doi:10.1007/3-540-46037-3_6

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  12. Lundgren, J.R.: Food webs, competition graphs, competition-common enemy graphs, and niche graphs. In: Roberts, F. (ed.) Applications of Combinatorics and Graph Theory to the Biological and Social Sciences. The IMA Volumes in Mathematics and its Applications, vol. 17, pp. 221–243. Springer, New York (1989)

    Chapter  Google Scholar 

  13. Mäkinen, E.: How to draw a hypergraph. Int. J. Comput. Math. 34(3–4), 177–185 (1990)

    Article  MATH  Google Scholar 

  14. Meulemans, W., Riche, N.H., Speckmann, B., Alper, B., Dwyer, T.: Kelpfusion: a hybrid set visualization technique. IEEE Trans. Vis. Comput. Graph. 19(11), 1846–1858 (2013)

    Article  Google Scholar 

  15. Ramadan, E., Tarafdar, A., Pothen, A.: A hypergraph model for the yeast protein complex network. In: Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International. p. 189. IEEE (2004)

    Google Scholar 

  16. Santamaría, R., Therón, R.: Visualization of intersecting groups based on hypergraphs. IEICE Trans. Inf. Syst. 93(7), 1957–1964 (2010)

    Article  Google Scholar 

  17. Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets. In: Computer Graphics Forum, pp. 967–974. Wiley Online Library (2009)

    Google Scholar 

  18. Verroust, A., Viaud, M.-L.: Ensuring the drawability of extended Euler diagrams for up to 8 sets. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol. 2980, pp. 128–141. Springer, Heidelberg (2004). doi:10.1007/978-3-540-25931-2_13

    Chapter  Google Scholar 

Download references

Acknowledgement

This work is supported by the National Research Foundation, Prime Minister’s Office, Singapore under its Campus for Research Excellence and Technological Enterprise (CREATE) programme.

Author information

Authors and Affiliations

  1. School of Computing, National University of Singapore, 13 Computing Drive, Singapore, 117417, Singapore

    Naheed Anjum Arafat & Stéphane Bressan

Authors
  1. Naheed Anjum Arafat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Bressan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naheed Anjum Arafat .

Editor information

Editors and Affiliations

  1. University of Lyon, Villeurbanne, France

    Djamal Benslimane

  2. University of Milan, Milan, Italy

    Ernesto Damiani

  3. University of Michigan, Dearborn, Michigan, USA

    William I. Grosky

  4. Paul Sabatier University, Toulouse, France

    Abdelkader Hameurlain

  5. Wright State University, Dayton, Ohio, USA

    Amit Sheth

  6. Johannes Kepler University, Linz, Austria

    Roland R. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Arafat, N.A., Bressan, S. (2017). Hypergraph Drawing by Force-Directed Placement. In: Benslimane, D., Damiani, E., Grosky, W., Hameurlain, A., Sheth, A., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2017. Lecture Notes in Computer Science(), vol 10439. Springer, Cham. https://doi.org/10.1007/978-3-319-64471-4_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64471-4_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64470-7

  • Online ISBN: 978-3-319-64471-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation