Efficient Genealogical Graph Layout

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient Genealogical Graph Layout

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Efficient Genealogical Graph Layout

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GA16-07210S" target="_blank" >GA16-07210S: Metody komplexních sítí aplikované na data starověkého Egypta v období Staré Říše (2700-2180 př. Kr.)</a><br>

Návaznosti

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

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

—

Počet stran výsledku

12

Strana od-do

567-578

Název nakladatele

Springer International Publishing

Místo vydání

Cham

Místo konání akce

Milan

Datum konání akce

30. 11. 2016

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000413483400045