7 hasil untuk "Ignaz Rutter"
Menampilkan 1–7 · 0,97 detik · RSS
-
Artikel Jurnal
An SPQR-tree-like embedding representation for level planarity
An SPQR-tree is a data structure that efficiently represents all planar embeddings of a connected planar graph. It is a key tool in a number of constrained planarity testing algorithms, which seek a planar embedding of a graph subject to some given set of constraints. We develop an SPQR-tree-like…
-
Artikel Jurnal
Maintaining Triconnected Components under Node Expansion
SPQR-trees model the decomposition of a biconnected graph into triconnected components. In this paper, we study the problem of dynamically maintaining an SPQR-tree while expanding vertices into arbitrary biconnected graphs. This allows us to efficiently merge two SPQR-trees by identifying the edges…
-
Artikel Jurnal
Consistent labeling of rotating maps
Dynamic maps that allow continuous map rotations, for example, on mobile devices, encounter new geometric labeling issues unseen in static maps before. We study the following dynamic map labeling problem: The input is an abstract map consisting of a set $P$ of points in the plane with attached…
-
Artikel Jurnal
On self-approaching and increasing-chord drawings of 3-connected planar graphs
An $st$-path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from $s$ to any point $t'$ on the curve the distance to $t'$ is non-increasing. A path has increasing chords if it is self-approaching in both directions. A drawing is self-approaching…
-
Artikel Jurnal
Polygon-universal graphs
We study a fundamental question from graph drawing: given a pair $(G,C)$ of a graph $G$ and a cycle $C$ in $G$ together with a simple polygon $P$ with equally many vertices as $C$, is there a straight-line drawing of $G$ inside $P$ which maps the $i$-th vertex of $C$ to the $i$-th vertex of $P$? We…
-
Artikel Jurnal
Scalable exact visualization of isocontours in road networks via minimum-link paths
Isocontours in road networks represent the area that is reachable from a source within a given resource limit. We study the problem of computing accurate isocontours in realistic, large-scale networks. We propose isocontours represented by polygons with minimum number of segments that separate…
-
Artikel Jurnal
The Price of Upwardness
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the edges are monotonically increasing in a…