PedVis: A Structured, Space-Efficient Technique for Pedigree Visualization

Public genealogical databases are becoming increasingly populated with historical data and records of the current population's ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree's structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user's ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.

[1]  N. Chick,et al.  The Church of Jesus Christ of Latter-day Saints , 2005 .

[2]  Fabrizio Frati,et al.  Straight-Line Orthogonal Drawings of Binary and Ternary Trees , 2007, GD.

[3]  Ben Shneiderman,et al.  Tree-maps: a space-filling approach to the visualization of hierarchical information structures , 1991, Proceeding Visualization '91.

[4]  Michael J. McGuffin,et al.  Interactive visualization of genealogical graphs , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[5]  Ivan Herman,et al.  Graph Visualization and Navigation in Information Visualization: A Survey , 2000, IEEE Trans. Vis. Comput. Graph..

[6]  Hideki Koike,et al.  Fractal approaches for visualizing huge hierarchies , 1993, Proceedings 1993 IEEE Symposium on Visual Languages.

[7]  George W. Furnas,et al.  Multitrees: enriching and reusing hierarchical structure , 1994, CHI '94.

[8]  David Eppstein,et al.  Worst-case bounds for subadditive geometric graphs , 1993, SCG '93.

[9]  Ashim Garg,et al.  Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio , 2002, J. Graph Algorithms Appl..

[10]  L. Rumble,et al.  The Church of Jesus Christ of Latter Day Saints , 1967 .

[11]  Timothy M. Chan A Near-Linear Area Bound for Drawing Binary Trees , 1999, SODA '99.

[12]  Jarke J. van Wijk,et al.  Smooth and efficient zooming and panning , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).

[13]  Mao Lin Huang,et al.  Space-Optimized Tree: A Connection+Enclosure Approach for the Visualization of Large Hierarchies , 2003, Inf. Vis..

[14]  Mao Lin Huang,et al.  A space-optimized tree visualization , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[15]  Mathys C. du Plessis,et al.  A ZoomTree interface for searching genealogical information , 2004, AFRIGRAPH '04.

[16]  Timothy M. Chan,et al.  Optimizing area and aspect ration in straight-line orthogonal tree drawings , 1996, Comput. Geom..

[17]  Ben Shneiderman,et al.  Treemaps for space-constrained visualization of hierarchies , 2005 .

[18]  Kyung-Yong Chwa,et al.  Area-efficient algorithms for straight-line tree drawings , 2000, Comput. Geom..

[19]  Geoffrey M. Draper,et al.  Interactive Fan Charts: A Space-saving Technique for Genealogical Graph Exploration , 2008 .

[20]  Jean-Daniel Fekete,et al.  Improving the Readability of Clustered Social Networks using Node Duplication , 2008, IEEE Transactions on Visualization and Computer Graphics.

[21]  Giuseppe Di Battista,et al.  A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..

[22]  Tamara Munzner,et al.  H3: laying out large directed graphs in 3D hyperbolic space , 1997, Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium.

[23]  Ramana Rao,et al.  A focus+context technique based on hyperbolic geometry for visualizing large hierarchies , 1995, CHI '95.

[24]  Kwan-Liu Ma,et al.  Rapid Graph Layout Using Space Filling Curves , 2008, IEEE Transactions on Visualization and Computer Graphics.

[25]  Jeffrey Heer,et al.  Tracing genealogical data with TimeNets , 2010, AVI.

[26]  Catherine Plaisant,et al.  SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[27]  Sally Anne Browning,et al.  The tree machine: a highly concurrent computing environment , 1980 .

[28]  Michael J. McGuffin,et al.  Quantifying the Space-Efficiency of 2D Graphical Representations of Trees , 2010, Inf. Vis..