Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Nickel, Soeren"'
A unit disk intersection representation (UDR) of a graph $G$ represents each vertex of $G$ as a unit disk in the plane, such that two disks intersect if and only if their vertices are adjacent in $G$. A UDR with interior-disjoint disks is called a un
Externí odkaz:
http://arxiv.org/abs/2103.08416
Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, all edge crossings and the result
Externí odkaz:
http://arxiv.org/abs/1908.08905
Autor:
Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Chimani, Markus, Kobourov, Stephen, Peltonen, Jaakko, Nöllenburg, Martin
Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as animated o
Externí odkaz:
http://arxiv.org/abs/1908.07291
Autor:
Nickel, Soeren, Nöllenburg, Martin
Traditionally, most schematic metro maps in practice as well as metro map layout algorithms adhere to an octolinear layout style with all paths composed of horizontal, vertical, and 45{\deg}-diagonal edges. Despite growing interest in more general mu
Externí odkaz:
http://arxiv.org/abs/1904.03039
Autor:
Nickel, Soeren, Nöllenburg, Martin, Sorge, Manuel, Villedieu, Anais, Wu, Hsiang-Yun, Wulms, Jules
The splitting number of a graph $G=(V,E)$ is the minimum number of vertex splits required to turn $G$ into a planar graph, where a vertex split removes a vertex $v \in V$, introduces two new vertices $v_1, v_2$, and distributes the edges formerly inc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56e1001bcc1e308d01189188717f9b37
Autor:
de Nooijer, Phoebe, Nickel, Soeren, Weinberger, Alexandra, Masárová, Zuzana, Mchedlidze, Tamara, Löffler, Maarten, Rote, Günter
A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate popular faces in an arrangement by insertin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88fd7e86026e9791078df4bd5d4a4095
Autor:
Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Kobourov, Stephen, Peltonen, Jaakko, Nollenburg, Martin
Publikováno v:
IEEE Transactions on Visualization & Computer Graphics; Jun2022, Vol. 28 Issue 6, p2376-2387, 12p
Autor:
Nickel, Soeren
In dieser Arbeit behandeln wir das Thema der automatischen Generierung von stabilen Demers Kartogrammen und Iso-Hexagon Kartogrammen. Ein Demers Kartogramm/Iso-Hexagon Kartogramm ist eine Repr��sentation von Daten auf einer Karte, in welcher alle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6bc861cfe099b518ffc623e7c338d6e