arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.02570cs.CG
收藏

实用I/O高效多路分离器

Practical I/O-Efficient Multiway Separators

Svend C. Svendsen

摘要:

我们重新审视I/O的基本问题,有效地计算$r$的方式分离平面图。$r$ -路分隔符将具有$N$顶点的平面图划分为总共大小为$O(N/r)$和$O(\sqrt {Nr})$边界顶点的$O(r)$区域,其中边界顶点是与多于一个区域相邻的顶点。这种分离器用于平面图上许多基本问题的I/O高效解决方案,例如广度优先搜索,寻找单源最短路径,拓扑排序和寻找强连通组件。我们的主要结果是一个I/O有效的采样算法,给定一个Koebe嵌入的图形与$N$顶点和一个参数$r$,计算$r$的方式分离器的内部存储器的大小在一定的假设下的图形。计算平面图的Koebe嵌入在实践中是困难的,并且目前不存在已知的I/O高效算法。因此,我们展示了我们的算法可以推广和直接应用到德洛内三角剖分,而不依赖于Koebe嵌入。这种适应可以产生许多边界顶点在最坏的情况下,然而,据我们所知,我们的结果是第一个在实践中实现,由于许多非平凡和复杂的技术在以前的结果。此外,我们表明,我们的算法在现实世界的数据表现良好,在实践中的边界顶点的数量是小的。出于几何信息系统中的应用,我们展示了我们的算法德洛内三角剖分可以应用于计算流量积累的地形,模型有多少水流过的顶点的地形。当给定一个$r$的方式分离器,我们的算法的实现优于传统的扫描线为基础的算法上公开可用的数字高程模型的丹麦。

英文摘要:

We revisit the fundamental problem of I/O-efficiently computing $r$-way separators on planar graphs. An $r$-way separator divides a planar graph with $N$ vertices into $O(r)$ regions of size $O(N/r)$ and $O(\sqrt {Nr})$ boundary vertices in total, where boundary vertices are vertices that are adjacent to more than one region. Such separators are used in I/O-efficient solutions to many fundamental problems on planar graphs such as breadth-first search, finding single-source shortest paths, topological sorting, and finding strongly connected components. Our main result is an I/O-efficient sampling-based algorithm that, given a Koebe-embedding of a graph with $N$ vertices and a parameter $r$, computes an $r$-way separator for the graph under certain assumptions on the size of internal memory. Computing a Koebe-embedding of a planar graph is difficult in practice and no known I/O-efficient algorithm currently exists. Therefore, we show how our algorithm can be generalized and applied directly to Delaunay triangulations without relying on a Koebe-embedding. This adaptation can produce many boundary vertices in the worst-case, however, to our knowledge our result is the first to be implemented in practice due to the many non-trivial and complex techniques used in previous results. Furthermore, we show that our algorithm performs well on real-world data and that the number of boundary vertices is small in practice. Motivated by applications in geometric information systems, we show how our algorithm for Delaunay triangulations can be applied to compute the flow accumulation over a terrain, which models how much water flows over the vertices of a terrain. When given an $r$-way separator, our implementation of the algorithm outperforms traditional sweep-line-based algorithms on the publicly available digital elevation model of Denmark.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑