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.

翻译：暂无翻译