Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.23559

Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints

Thomas Depian·Thomas C. van Dijk·Martin Nöllenburg
View original source ↗Read source document ↗Export metadata ↓

Abstract

Geophylogenies are a common type of diagram for visualizing the evolutionary history of species in a geographic context. As a drawing problem, these diagrams are commonly modeled as a rooted binary ''phylogenetic'' tree $T$ where every leaf is associated with a point feature (''site'') in a rectangular map range. The tree is drawn downward planar, its leaves are placed at equidistant positions on the upper boundary of the map, and each leaf is connected to its corresponding site by a straight-line leader. Prior work focuses on minimizing the number of leader crossings, or avoiding leaders altogether. In this paper, we explore paged geophylogenies, where the leaders can be partitioned into multiple pages where only crossings within a page are counted. For the general case, where each page can contain an arbitrary subset of the leaders, we provide an integer linear programming (ILP) formulation for minimizing the number of pages, and a polynomial-time algorithm for a special case that is equivalent to a one-sided tanglegram. We argue that, from a visualization perspective, instead each page must contain only leaders for a single subtree, and provide an $\mathcal{O}(n^7)$ time algorithm for minimizing pages in this setting - which also involves improving the fastest known algorithm for testing the existence of a crossing-free labeling. Counter to what our worst case bound suggests, our implementation can handle instances with hundreds of sites within a second, as we show in our experimental evaluation, which further investigates the trade-offs between leader crossings and the number of pages.

Explore related subjects

cs.CGcs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Depian, Thomas C. van Dijk, Martin Nöllenburg. 2026-07-26. Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints. https://arxiv.org/abs/2607.23559

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Homological Trimming and Regularity of Filtrations via Local Obstruction Modules

Existing link-based combinatorial preprocessing methods speed up the computation of persistent homology by removing a vertex or edge only when its link remains a cone. We replace this condition with a quantitative homological certificate. The reduced homology of the filtered link of a generator (a vertex or edge) defines a local obstruction module whose future part describes the effect of deleting that generator. Its barcode certifies either exact deletion or an explicit bound on the bottleneck error, and a conflict colouring extends this guarantee to families of generators. Our implementation, HomTrim, removes an additional 13% to 41% of the input edges beyond domination-only preprocessing and reduces backend persistence time by factors ranging from 1.55 to 4.61 on weighted flag filtrations. The same module also yields regularity diagrams that measure how far a generator can move before becoming visible to homology, together with a multiscale stability result.

cs.CG↗
arXiv2026

Exact and Approximate Range Queries in Ball Mapper

Ball Mapper summarizes a finite metric dataset by covering the sample with closed balls centered at selected landmarks and connecting landmarks whose balls share observations. Its construction therefore depends critically on repeated fixed radius range queries, yet the effect of replacing exact queries by approximate search has not been systematically characterized. We formulate Ball Mapper through an abstract range query procedure that separates the mathematical construction from the search backend used to realize it. Under fixed ordering, exact procedures preserve the landmark sequence, cover, graph, and membership-based colorings. For approximate procedures, we derive deterministic bounds on covering radius and landmark separation under additive and multiplicative query errors, prove inclusions for the induced nerve, characterize edge survival through witness redundancy for conservative approximations, and bound perturbations of mean vertex colorings. The accompanying implementation provides independent exact reference backends together with exhaustive and approximate search methods under a common closed ball convention. Experiments on Gaussian, mixture, and noisy curve data across three seeds show that approximation fidelity depends strongly on geometry and that edges supported by multiple witnesses are substantially more robust to missed memberships. At 20,000 observations, the approximate indexes did not outperform exhaustive FAISS Flat search. The results therefore establish a framework for controlled approximation rather than a universal speed advantage, and identify the geometric and combinatorial quantities that govern when approximate range search preserves the Ball Mapper summary.

cs.CG↗
arXiv2026

Tight Fréchet bounds for $λ$-low density curves

The Fréchet distance is a well-studied similarity measure between curves. We computing the Fréchet distance between $λ$-low-density curves, the most general of realistic curve assumptions, where every ball of radius $r$ intersects at most $λ$ edges of length at least $r$. Previous algorithms either assumed constant $λ$ or had no tight dependence on $λ$. For two $n$-vertex $λ$-low-density curves in $\mathbb{R}^d$, we give a $(1+\varepsilon)$-approximation algorithm for the continuous and discrete Fréchet distance running in $ \tilde{O}\!\left(\frac{λ^{2/d}n^{2-2/d}}{\varepsilon^2}\right) $ time. Our key insight is a tight property of simplifying $λ$-low density curves: the simplification of any $n$-vertex $λ$-low-density curve is $O(λ^{1/d}n^{1-1/d})$-low-density. We show this is tight, and this provides the structural property under simplification that was previously known for $c$-packed curves. We provide matching lower bounds for $n$ and $λ$: assuming the Orthogonal Vectors Hypothesis, for every $δ>0$, we rule out algorithms with running time $O\!\left( \left( \frac{λ^{2/d}n^{2-2/d}} {\varepsilon^{2-4/d}} \right)^{1-δ} \right). $ We extend our techniques to the map matching problem, where we also give tight bounds.

cs.CG↗