Efficient Genealogical Graph Layout

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00308564" target="_blank" >RIV/68407700:21230/17:00308564 - isvavai.cz</a>

Result on the web

<a href="http://link.springer.com/chapter/10.1007%2F978-3-319-50901-3_45" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-50901-3_45</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-50901-3_45" target="_blank" >10.1007/978-3-319-50901-3_45</a>

Result language

angličtina

Original language name

Efficient Genealogical Graph Layout

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA16-07210S" target="_blank" >GA16-07210S: Complex Networks Methods Applied to Ancient Egypt Data in the Old Kingdom (2700-2180 BC)</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016)

ISBN

978-3-319-50901-3

ISSN

1860-949X

e-ISSN

—

Number of pages

12

Pages from-to

567-578

Publisher name

Springer International Publishing

Place of publication

Cham

Event location

Milan

Event date

Nov 30, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000413483400045