Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Terziadis, Soeren"'
Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresponding points are connected via crossing-free leaders. We propose orbi
Externí odkaz:
http://arxiv.org/abs/2403.19052
Boundary labeling is a technique used to label dense sets of feature points in an illustration. It involves placing labels along a rectangular boundary box and connecting each label with its corresponding feature using non-crossing leader lines. Alth
Externí odkaz:
http://arxiv.org/abs/2402.12245
Autor:
Förster, Henry, Kindermann, Philipp, Miltzow, Tillmann, Parada, Irene, Terziadis, Soeren, Vogtenhuber, Birgit
We say that a (multi)graph $G = (V,E)$ has geometric thickness $t$ if there exists a straight-line drawing $\varphi : V \rightarrow \mathbb{R}^2$ and a $t$-coloring of its edges where no two edges sharing a point in their relative interior have the s
Externí odkaz:
http://arxiv.org/abs/2312.05010
In public transport networks disruptions may occur and lead to travel delays. It is thus interesting to determine whether a traveler can be resilient to delays that occur unexpectedly, ensuring that they can reach their destination in time regardless
Externí odkaz:
http://arxiv.org/abs/2308.12265
Autor:
Bhore, Sujoy, Klute, Fabian, Löffler, Maarten, Nöllenburg, Martin, Terziadis, Soeren, Villedieu, Anaïs
We study a variant of the geometric multicut problem, where we are given a set $\mathcal{P}$ of colored and pairwise interior-disjoint polygons in the plane. The objective is to compute a set of simple closed polygon boundaries (fences) that separate
Externí odkaz:
http://arxiv.org/abs/2209.14804
Metro or transit maps, are schematic representations of transit networks to facilitate effective route-finding. These maps are often advertised on a web page or pamphlet highlighting routes from source to destination stations. To visually support suc
Externí odkaz:
http://arxiv.org/abs/2208.14261
Autor:
Nöllenburg, Martin, Sorge, Manuel, Terziadis, Soeren, Villedieu, Anaïs, 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:
http://arxiv.org/abs/2202.12293
Autor:
de Nooijer, Phoebe, Terziadis, 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 the popular faces in an arrangement by inse
Externí odkaz:
http://arxiv.org/abs/2202.12175
Autor:
Nöllenburg, Martin1 (AUTHOR), Terziadis, Soeren1 (AUTHOR) sterziadis@ac.tuwien.ac.at
Publikováno v:
Cartographic Journal. Nov2023, Vol. 60 Issue 4, p367-382. 16p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.