Skip to main content
SpringerLink
Log in

Efficient Genealogical Graph Layout

  • Conference paper
  • First Online:
Complex Networks & Their Applications V (COMPLEX NETWORKS 2016 2016)

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

Included in the following conference series:

Abstract

While a visual unconstrained tree structure planar layout design is easy to implement, a visualization of a tree with constraints on node ranks and their ordering within ranks leads to a difficult combinatorial problem. A genealogical graph, such as family tree, can be taken as an example of such a case. Classical ancestor trees, descendant trees, Hourglass charts, and their visual variants such as node-link diagrams or fan charts are suitable for assessment of peoples relationships when one is focused on a particular person and his/her direct ancestors and descendants. Such tree-based representations miss a broader context of relationships and do not allow the quick assessment of several interlinked families together. We propose a new undirected tree-driven layout technique for layered multitree graph visualizations producing constraints on node layers and ordering of groups of nodes within layers. The computed constraints can be mapped, at least partially, into the DOT language property directives used by the Graphviz toolbox. We demonstrate achievements on several datasets containing up to 39000 people.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gramps. genealogical research software. https://gramps-project.org/ (2016). Accessed: 5.6.2016

  2. Graphviz - graph visualization software. www.graphviz.org (2016). Accessed: 5.6.2016

  3. Myheritage. https://www.myheritage.cz (2016). Accessed: 5.6.2016

  4. yed graph editor. http://www.yworks.com/products/yed (2016). Accessed: 5.6.2016

  5. Ball, R., Cook, D.: A family-centric genealogy visualization paradigm. In: 14th Annual Family History Technology Workshop. Provo, Utah (2014)

    Google Scholar 

  6. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13(3), 335–379 (1976)

    Google Scholar 

  7. Brandes, U., Köpf, B.: Fast and Simple Horizontal Coordinate Assignment, pp. 31–44. Springer Berlin Heidelberg, Berlin, Heidelberg (2002). DOI 10.1007/3-540-45848-4_3. URL http://dx.doi.org/10.1007/3-540-45848-4_3

  8. Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.M.: Upward planarization layout. Journal of Graph Algorithms and Applications 15(1), 127–155 (2011)

    Google Scholar 

  9. Chimani, M., Junger, M., Schulz, M.: Crossing minimization meets simultaneous drawing. In: 2008 IEEE Pacific Visualization Symposium, pp. 33–40 (2008). DOI 10.1109/PACIFICVIS. 2008.4475456

  10. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition, 3rd edn. The MIT Press (2009)

    Google Scholar 

  11. Diestel, R.: Graph Theory. Springer (2005)

    Google Scholar 

  12. Dulíková, V.: The reign of king Nyuserre and its impact on the development of the Egyptian state. A multiplier effect period during the Old Kingdom. Ph.D. thesis, Charles University in Prague, Faculty of Arts, Czech Institute of Egyptology (2016)

    Google Scholar 

  13. Eiglsperger, M., Siebenhaller, M., Kaufmann, M.: An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing, pp. 155–166. Springer Berlin Heidelberg, Berlin, Heidelberg (2005). DOI 10.1007/978-3-540-31843-9_17. URL http://dx.doi.org/10.1007/978-3-540-31843-9_17

  14. Furnas, G.W., Zacks, J.: Multitrees: Enriching and reusing hierarchical structure. In: Conference Companion on Human Factors in Computing Systems, CHI ’94, pp. 223–. ACM, New York, NY, USA (1994). DOI 10.1145/259963.260396. URL http://doi.acm.org/10.1145/259963.260396

  15. Gansner, E.R., Koutsofios, E., North, S.C., phong Vo, K.: A technique for drawing directed graphs. IEEE Transactions nn Software Engineering 19(3), 214–230 (1993)

    Google Scholar 

  16. Gibson, H., Faith, J., Vickers, P.: A survey of two-dimensional graph layout techniques for information visualisation. Information Visualization 12(3-4), 324–357 (2013). DOI 10.1177/1473871612455749. URL http://ivi.sagepub.com/content/12/3-4/324.abstract

  17. Healy, P., Nikolov, N.S.: Handbook of Graph Drawing and Visualization, chap. Hierarchical Drawing Algorithms, pp. 409–454. CRC (2013)

    Google Scholar 

  18. Hopcroft, J., Tarjan, R.: Algorithm 447: Efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973). DOI 10.1145/362248.362272. URL http://doi.acm.org/10.1145/362248.362272

  19. Hopcroft, J., Tarjan, R.: Efficient planarity testing. Journal of the ACM 21(4), 549–568 (1974). DOI 10.1145/321850.321852. URL http://doi.acm.org/10.1145/321850.321852

  20. Hsu, W.L., McConnell, R.: Handbook of Data Structures and Applications, chap. PQ Trees, PC Trees, and Planar Graphs, pp. 32–1–32–27. CRC Press (2004)

    Google Scholar 

  21. Keller, K., Reddy, P., Sachdeva, S.: Family tree visualization. Course project report. http://vis.berkeley.edu/courses/cs294-10-sp10/wiki/images/f/f2/Family_Tree_Visualization_-_Final_Paper.pdf (2010). Accessed: 5.6.2016

  22. Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: Hola: Human-like orthogonal network layout. IEEE Transactions on Visualization and Computer Graphics 22(1), 349–358 (2016). DOI 10.1109/TVCG.2015.2467451

  23. Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: P. Rosenstiehl, Gordon, Breach (eds.) Theory of Graphs, pp. 215–232. New York (1967)

    Google Scholar 

  24. Marik, R.: On large genealogical graph layouts (accepted for publication). In: WASACNA 2016 : Workshop on Algorithmic and Structural Aspects of Complex Networks and Applications, September 17th, Tatransk Matliare, Slovakia (2016)

    Google Scholar 

  25. Mathews, E., Frey, H.: A Localized Link Removal and Addition Based Planarization Algorithm, pp. 337–350. Springer Berlin Heidelberg, Berlin, Heidelberg (2012). DOI 10.1007/978-3-642-25959-3_25. URL http://dx.doi.org/10.1007/978-3-642-25959-3_25

  26. McGrath, C., Blythe, J., Krackhardt, D.: Seeing groups in graph layouts. Connections 19(2), 22–29 (1996)

    Google Scholar 

  27. McGuffin, M.J., Balakrishnan, R.: Interactive visualization of genealogical graphs. In: IEEE Symposium on Information Visualization, 2005. INFOVIS 2005., pp. 16–23 (2005). DOI 10.1109/INFVIS.2005.1532124

  28. Paton, K.: An algorithm for the blocks and cutnodes of a graph. Commun. ACM 14(7), 468–475 (1971). DOI 10.1145/362619.362628. URL http://doi.acm.org/10.1145/362619.362628

  29. Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Transactions on Software Engineering SE-7(2), 223–228 (1981). DOI 10.1109/TSE.1981.234519

  30. Resende, M.G.C., Ribeiro, C.C.: Graph planarizationGraph Planarization, pp. 908–913. Springer US, Boston, MA (2001). DOI 10.1007/0-306-48332-7_187. URL http://dx. doi.org/10.1007/0-306-48332-7_187

  31. Shih,W.K., Hsu,W.L.: A new planarity test. Theoretical Computer Science 223(1-2), 179–191 (1999)

    Google Scholar 

  32. Sugiyama, K., Misue, K.: Visualization of structural information: automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics 21(4), 876–892 (1991). DOI 10.1109/21.108304

  33. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11(2), 109–125 (1981). DOI 10.1109/TSMC.1981.4308636

  34. Tutte, W.T.: Convex representations of graphs. Proceedings of the London Mathematical Society, Third Series (10), 304–320 (1960)

    Google Scholar 

  35. Tutte, W.T.: How to draw a graph. Proceedings of the London Mathematical Society, Third Series (13), 743–768 (1960)

    Google Scholar 

  36. Tuttle, C., Nonato, L.G., Silva, C.: Pedvis: A structured, space-efficient technique for pedigree visualization. IEEE Transactions on Visualization and Computer Graphics 16(6), 1063–1072 (2010). DOI 10.1109/TVCG.2010.185

  37. Warfield, J.N.: Crossing theory and hierarchy mapping. IEEE Transactions on Systems, Man, and Cybernetics 7(7), 505–523 (1977). DOI 10.1109/TSMC.1977.4309760

  38. Yoghourdjian, V., Dwyer, T., Gange, G., Kieffer, S., Klein, K., Marriott, K.: High-quality ultra-compact grid layout of grouped networks. IEEE Transactions on Visualization and Computer Graphics 22(1), 339–348 (2016). DOI 10.1109/TVCG.2015.2467251

Download references

Author information

Authors and Affiliations

  1. Department of Telecommunication Engineering, Faculty of Electrical Engineering, Czech Technical, University in Prague, Technicka 2, Dejvice, Prague, CZ-166 27, Czech Republic

    Radek Marik

Authors
  1. Radek Marik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Radek Marik .

Editor information

Editors and Affiliations

  1. University of Burgundy , Dijon, France

    Hocine Cherifi

  2. Computer Science Department, University of Milan Computer Science Department, Milan, Italy

    Sabrina Gaito

  3. IMT Lucca , Lucca, Italy

    Walter Quattrociocchi

  4. Blanchardstown Business and Tech Park, Bell Labs-Nokia Blanchardstown Business and Tech Park, Blanchardstown, Ireland

    Alessandra Sala

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Marik, R. (2017). Efficient Genealogical Graph Layout. In: Cherifi, H., Gaito, S., Quattrociocchi, W., Sala, A. (eds) Complex Networks & Their Applications V. COMPLEX NETWORKS 2016 2016. Studies in Computational Intelligence, vol 693. Springer, Cham. https://doi.org/10.1007/978-3-319-50901-3_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50901-3_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50900-6

  • Online ISBN: 978-3-319-50901-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation