arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.08843cs.CGcs.DS
收藏

几何问题的预排序层次结构

The Presort Hierarchy for Geometric Problems

IT University of Copenhagen(哥本哈根信息技术大学)

Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson, Lasse Wulf

AI总结:

本文提出预排序层次结构,证明四叉树、Delaunay三角剖分、Voronoi图和欧几里得最小生成树等几何问题在两个方向排序下可实现o(n log n)时间算法。

摘要:

许多计算几何基本问题无法在o(n log n)时间内解决,除非通过经典排序还原。凸包、四叉树、洋葱层分解、欧几里得最小生成树、k-d树、Voronoi图和增量最近点对等问题均需此条件。本文引入预排序层次结构,定义1-预排序可解决单轴排序下的问题,2-预排序需双轴排序,否则为预排序难。主要结果表明四叉树、Delaunay三角剖分、Voronoi图和欧几里得最小生成树为2-预排序可解,算法预期运行时间为O(n√log n)。同时,部分其他几何问题也被证明为2-预排序可解或预排序难。

英文摘要:

Many fundamental problems in computational geometry admit no algorithm running in $o(n \log n)$ time for $n$ planar input points, via classical reductions from sorting. Prominent examples include the computation of convex hulls, quadtrees, onion layer decompositions, Euclidean minimum spanning trees, KD-trees, Voronoi diagrams, and decremental closest-pair. A classical result shows that, given $n$ points sorted along a single direction, the convex hull can be constructed in linear time. Subsequent works established that for all of the other above problems, this information does not suffice. In 1989, Aggarwal, Guibas, Saxe, and Shor asked: Under which conditions can a Voronoi diagram be computed in $o(n \log n)$ time? Since then, the question of whether sorting along TWO directions enables a $o(n \log n)$-time algorithm for such problems has remained open and has been repeatedly mentioned in the literature. In this paper, we introduce the Presort Hierarchy: A problem is 1-Presortable if, given a sorting along one axis, it permits a (possibly randomised) $o(n \log n)$-time algorithm. It is 2-Presortable if sortings along both axes suffice. It is Presort-Hard otherwise. Our main result is that quadtrees, and by extension Delaunay triangulations, Voronoi diagrams, and Euclidean minimum spanning trees, are 2-Presortable: we present an algorithm with expected running time $O(n \sqrt{\log n})$. This addresses the longstanding open problem posed by Aggarwal, Guibas, Saxe, and Shor (albeit randomised). We complement this result by showing that some of the other above geometric problems are also 2-Presortable or Presort-Hard.

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

↑