Biblio Discovery — Demo Discovery Service

12 hasil untuk "Tim Ophelders"

Menampilkan 1–12 · 0,37 detik · RSS

  1. 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…

  2. Artikel Jurnal

    Relating interleaving and Fréchet distances via ordered merge trees

    Thijs Beurskens; Tim Ophelders; Bettina Speckmann dkk.

    Journal of Computational Geometry, Vol. 17 No. 1 · 2026 · Inggris · DOAJ Scopus

    Merge trees are a common topological descriptor for data with a hierarchical component, such as terrains and scalar fields. The interleaving distance, in turn, is a common distance for comparing merge trees. However, the interleaving distance for merge trees is solely based on the hierarchical…

  3. Artikel Jurnal

    Counting triangulations of fixed cardinal degrees

    Erin Chambers; Tim Ophelders; Anna Schenfisch dkk.

    Journal of Computational Geometry, Vol. 17 No. 1 · 2026 · Inggris · DOAJ Scopus

    A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if we know, for each vertex, the number of neighbors in each…

  4. Artikel Jurnal

    Shortest paths in portalgons

    Tim Ophelders; Maarten Löffler; Rodrigo I. Silveira dkk.

    Journal of Computational Geometry, Vol. 15 No. 2 · 2025 · Inggris · DOAJ Scopus

    Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric. We refer to such a representation as a…

  5. Artikel Jurnal

    Faster Fréchet distance approximation through truncated smoothing

    Thijs van der Horst; Marc van Kreveld; Tim Ophelders dkk.

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

    The Fréchet distance is a commonly used distance measure for curves. Computing the Fréchet distance between two polygonal curves of $n$ vertices takes roughly quadratic time, and conditional lower bounds suggest that approximating to within a factor $3$ cannot be done in strongly-subquadratic time…

  6. Artikel Jurnal

    The geodesic Fréchet distance between two curves bounding a simple polygon

    Thijs van der Horst; Marc van Kreveld; Tim Ophelders dkk.

    Journal of Computational Geometry, Vol. 17 No. 1 · 2026 · Inggris · DOAJ Scopus

    The Fréchet distance is a popular similarity measure that is well understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved significantly, even in one dimension and when approximating with a…

  7. Artikel Jurnal

    A near-linear time exact algorithm for the \(L_1\)-geodesic Fréchet distance between two curves on the boundary of a simple polygon

    Thijs van der Horst; Marc van Kreveld; Tim Ophelders dkk.

    Computing in Geometry and Topology, Vol. 5 No. 1 · 2026 · Inggris · DOAJ

    Let \(P\) be a polygon with \(k\)vertices. Let \(R\) and \(B\) be two simple, interior disjoint curves on the boundary of \(P\), with \(n\) and \(m\) vertices. We show how to compute the Fréchet distance between \(R\) and \(B\) using the geodesic \(L_1\)-distance in \(P\) in \(O(k \log nm + (n+m)…

  8. Artikel Jurnal

    Optimal in-place compaction of sliding cubes

    Tom Peters; Irina Kostitsyna; Tim Ophelders dkk.

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

    The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. As is common in the literature, we focus on reconfiguration via an intermediate canonical shape. Specifically, we…

  9. Artikel Jurnal

    Computing representative networks for braided rivers

    Maarten Kleinhans; Marc van Kreveld; Tim Ophelders dkk.

    Journal of Computational Geometry, Vol. 10 No. 1 · 2019 · Inggris · DOAJ Scopus

    Drainage networks on terrains have been studied extensively from an algorithmic perspective. However, in drainage networks water flow cannot bifurcate and hence they do not model \emph{braided rivers} (multiple channels which split and join, separated by sediment bars). We initiate the algorithmic…

  10. Artikel Jurnal

    Morphing Planar Graph Drawings Through 3D

    Kevin Buchin; Will Evans; Fabrizio Frati dkk.

    Computing in Geometry and Topology, Vol. 2 No. 1 · 2023 · Inggris · DOAJ

    In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-line drawings of an n-vertex planar graph, there exists a piecewise-linear crossing-free 3D morph with O(n2) steps that…

  11. Artikel Jurnal

    The shape of aroma: Measuring and modeling citrus oil gland distribution

    Erik J. Amézquita; Michelle Y. Quigley; Tim Ophelders dkk.

    Plants, People, Planet, Vol. 5 No. 5 · 2023 · Inggris · DOAJ Scopus

    Societal Impact Statement Citrus are intrinsically connected to human health and culture, preventing human diseases like scurvy and inspiring sacred rituals. Citrus fruits come in a stunning number of different sizes and shapes, ranging from small clementines to oversized pummelos, and fruits…

  12. Artikel Jurnal

    Convex polygons in cartesian products

    Jean-Lou De Carufel; Adrian Dumitrescu; Wouter Meulemans dkk.

    Journal of Computational Geometry, Vol. 11 No. 2 · 2021 · Inggris · DOAJ Scopus

    We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of $n$ real numbers (for short, \emph{grid}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex position and that this bound is tight up to a constant factor. We…