Zobrazeno 1 - 10 of 198 pro vyhledávání: '"Stephen G. Kobourov"'
1
MetroSets: Visualizing Sets as Metro Maps
Autor: Martin Nöllenburg, Ben Jacobsen, Stephen G. Kobourov, Markus Wallinger
Publikováno v: IEEE Transactions on Visualization and Computer Graphics. 27:1257-1267
We propose MetroSets, a new, flexible online tool for visualizing set systems using the metro map metaphor. We model a given set system as a hypergraph $\mathcal{H} = (V, \mathcal{S})$, consisting of a set $V$ of vertices and a set $\mathcal{S}$, whi
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eace2c6c6c8b6f0c2a2cb207aca97011
https://doi.org/10.1109/tvcg.2020.3030475
Zobrazit plný text záznamu
2
Drawing Shortest Paths in Geodetic Graphs
Autor: Michael Hoffmann, Maximilian Pfister, Thomas Schneck, Stephen G. Kobourov, Henry Förster, Sabine Cornelsen, Martin Gronemann
Publikováno v: Journal of Graph Algorithms and Applications, 26 (3)
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Lecture Notes in Computer Science, 12590
Graph Drawing and Network Visualization
Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph G, i.e., an unweighted graph in which the shortest path between any pair of vert
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b09496f2c6414f25a034d4b72077c185
https://hdl.handle.net/20.500.11850/592797
Zobrazit plný text záznamu
4
Approximation Algorithms for Priority Steiner Tree Problems
Autor: Richard Spence, Faryad Darabi Sahneh, Stephen G. Kobourov
Publikováno v: Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
In the Priority Steiner Tree (PST) problem, we are given an undirected graph \(G=(V,E)\) with a source \(s \in V\) and terminals \(T \subseteq V \setminus \{s\}\), where each terminal \(v \in T\) requires a nonnegative priority P(v). The goal is to c
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::82328bcf65af30018efb3a4e86bbb505
https://doi.org/10.1007/978-3-030-89543-3_10
Zobrazit plný text záznamu
5
Using the Metro-Map Metaphor for Drawing Hypergraphs
Autor: Tamara Mchedlidze, Stephen G. Kobourov, Torsten Ueckerdt, Alexander Wolff, Sergey Pupyrev, Fabian Frank, Michael Kaufmann
Publikováno v: SOFSEM 2021: Theory and Practice of Computer Science ISBN: 9783030677305
SOFSEM
For a planar graph G and a set \(\varPi \) of simple paths in G, we define a metro-map embedding to be a planar embedding of G and an ordering of the paths of \(\varPi \) along each edge of G. This definition of a metro-map embedding is motivated by
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::069d384a41951975c48998c755842bb7
https://doi.org/10.1007/978-3-030-67731-2_26
Zobrazit plný text záznamu
6
On Additive Spanners in Weighted Graphs with Local Error
Autor: Greg Bodwin, Richard Spence, Stephen G. Kobourov, Reyan Ahmed, Keaton Hamm
Publikováno v: Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG
An additive \(+\beta \) spanner of a graph G is a subgraph which preserves distances up to an additive \(+\beta \) error. Additive spanners are well-studied in unweighted graphs but have only recently received attention in weighted graphs [Elkin et a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cd04a4601ae13b86540d57805a1276eb
https://doi.org/10.1007/978-3-030-86838-3_28
Zobrazit plný text záznamu
7
On the Readability of Abstract Set Visualizations
Autor: Martin Nöllenburg, Ben Jacobsen, Stephen G. Kobourov, Markus Wallinger
Set systems are used to model data that naturally arises in many contexts: social networks have communities, musicians have genres, and patients have symptoms. Visualizations that accurately reflect the information in the underlying set system make i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f31caaf3c508a2c3d11a13d21f8a167
Zobrazit plný text záznamu
8
Recognition and Recall of Geographic Data In Cartograms
Autor: Sabrina Nusrat, Stephen G. Kobourov, Jawaherul Md. Alam
Publikováno v: AVI
We investigate the memorability of two types of cartograms, both in terms of recognition of the visualization and recall of the data. A cartogram, or a value-by-area map, is a representation of a map in which geographic regions are modified to reflec
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::def7f75aaab8e97048450cff8e630b89
https://doi.org/10.1145/3399715.3399873
Zobrazit plný text záznamu
9
Drawing Graphs on the Sphere
Autor: Mason Sun Yin, Scott M. Perry, Stephen G. Kobourov, Kathryn Gray
Publikováno v: AVI
Graphs are most often visualized in the two dimensional Euclidean plane, but spherical space offers several advantages when visualizing graphs. First, some graphs such as skeletons of three dimensional polytopes (tetrahedron, cube, icosahedron) have
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::90859b37a4a983459f9e638137b67c3d
https://doi.org/10.1145/3399715.3399915
Zobrazit plný text záznamu
10
The Turing Test for Graph Drawing Algorithms
Autor: Hsiang-Yun Wu, Sergey Pupyrev, Stephen G. Kobourov, Daniel Archambault, Martin Nöllenburg, Helen C. Purchase
Publikováno v: Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on ‘small’ graphs, of a size for which it would
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bd4b71d420e3df476441c53a4235af9
https://doi.org/10.1007/978-3-030-68766-3_36
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje