Biblio Discovery — Demo Discovery Service

7 hasil untuk "Ignaz Rutter"

Menampilkan 1–7 · 0,97 detik · RSS

  1. Artikel Jurnal

    An SPQR-tree-like embedding representation for level planarity

    Guido Brückner; Ignaz Rutter

    Journal of Computational Geometry, Vol. 14 No. 1 · 2023 · Inggris · DOAJ Scopus

    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…

  2. Artikel Jurnal

    Maintaining Triconnected Components under Node Expansion

    Simon Dominik Fink; Ignaz Rutter

    Computing in Geometry and Topology, Vol. 3 No. 2 · 2024 · Inggris · DOAJ

    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…

  3. Artikel Jurnal

    Consistent labeling of rotating maps

    Andreas Gemsa; Martin Nöllenburg; Ignaz Rutter

    Journal of Computational Geometry, Vol. 7 No. 1 · 2016 · Inggris · DOAJ Scopus

    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…

  4. Artikel Jurnal

    On self-approaching and increasing-chord drawings of 3-connected planar graphs

    Martin Nöllenburg; Roman Prutkin; Ignaz Rutter

    Journal of Computational Geometry, Vol. 7 No. 1 · 2016 · Inggris · DOAJ Scopus

    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…

  5. Artikel Jurnal

    Polygon-universal graphs

    Tim Ophelders; Ignaz Rutter; Bettina Speckmann dkk.

    Journal of Computational Geometry, Vol. 16 No. 1 · 2025 · Inggris · DOAJ Scopus

    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…

  6. Artikel Jurnal

    Scalable exact visualization of isocontours in road networks via minimum-link paths

    Moritz Baum; Thomas Bläsius; Andreas Gemsa dkk.

    Journal of Computational Geometry, Vol. 9 No. 1 · 2018 · Inggris · DOAJ Scopus

    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…

  7. Artikel Jurnal

    The Price of Upwardness

    Patrizio Angelini; Therese Biedl; Markus Chimani dkk.

    Discrete Mathematics & Theoretical Computer Science, Vol. vol. 27:3 No. Graph Theory · 2025 · Inggris · DOAJ Scopus

    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…