Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Adrien Castella"'
Autor:
Michael Burch, Kiet Bennema ten Brinke, Adrien Castella, Ghassen Karray Sebastiaan Peters, Vasil Shteriyanov, Rinse Vlasvinkel
Publikováno v:
Visual Computing for Industry, Biomedicine, and Art, Vol 4, Iss 1, Pp 1-14 (2021)
Abstract The visualization of dynamic graphs is a challenging task owing to the various properties of the underlying relational data and the additional time-varying property. For sparse and small graphs, the most efficient approach to such visualizat
Externí odkaz:
https://doaj.org/article/ac4c3c776a354f6088ea4daa3403d6ec
Autor:
Rinse Vlasvinkel, Vasil Shteriyanov, Adrien Castella, Ghassen Karray Sebastiaan Peters, Michael Burch, Kiet Bennema ten Brinke
Publikováno v:
Visual Computing for Industry, Biomedicine, and Art
Visual Computing for Industry, Biomedicine, and Art, Vol 4, Iss 1, Pp 1-14 (2021)
Visual Computing for Industry, Biomedicine, and Art, Vol 4, Iss 1, Pp 1-14 (2021)
The visualization of dynamic graphs is a challenging task owing to the various properties of the underlying relational data and the additional time-varying property. For sparse and small graphs, the most efficient approach to such visualization is no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac111ed4c64dbc6abc4c2299c1298356
https://pubmed.ncbi.nlm.nih.gov/34491465
https://pubmed.ncbi.nlm.nih.gov/34491465
Autor:
Kiet Bennema ten Brinke, Sebastiaan Peters, Adrien Castella, Ghassen Karray, Michael Burch, Rinse Vlaswinkel, Vasil Shteriyanov
Publikováno v:
VINCI
Visualizing graphs is a challenging task due to the various properties of the underlying relational data. For sparse and small graphs the perceptually most efficient way are node-link diagrams whereas for dense graphs with attached data, adjacency ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2a9888d9bafbaa187b6fe0b741e5484
https://doi.org/10.1145/3430036.3430064
https://doi.org/10.1145/3430036.3430064