We study the problem of enumerating k farthest pairs for n points in the plane and the problems of enumerating k closest/farthest bichromatic pairs of n red and n blue points in the plane. We propose a new technique for geometric enumeration problems which iteratively reduces the search space by a half and provides efficient algorithms. As applications of this technique, we develop algorithms, using higher order Voronoi diagrams, for the above problems, which run in O(min{n2, n log n + k4/3 log n/log1/3k}) time and O(n+k4/3/(log k)1/3+k log n) space. Since, to the authors' knowledge, no nontrivial algorithms have been known for these problems, our algorithms are currently fastest when k=o(n3/2).
展开▼
机译:
我们研究了在平面中为 n ITALIC>个点枚举 k ITALIC>个最远对的问题以及枚举 k ITALIC>个最接近/最远的双色对的问题平面中的 n ITALIC>红色和 n ITALIC>蓝色点。我们提出了一种针对几何枚举问题的新技术,该技术可将搜索空间迭代减少一半,并提供有效的算法。作为这项技术的应用,我们针对上述问题,使用高阶Voronoi图开发了算法,这些算法在 O ITALIC>(min { n ITALIC> 2 SUPSCRPT >, n ITALIC>日志 n ITALIC> + k ITALIC> 4/3 SUPSCRPT>日志 n ITALIC> / log < SUPSCRPT> 1/3 SUPSCRPT> k ITALIC>}时间和 O ITALIC>( n ITALIC> + k ITALIC> 4/3 SUPSCRPT> /(log k ITALIC>) 1/3 SUPSCRPT> + k ITALIC> log n ITALIC>)空间。因为据作者所知,没有非平凡的算法可解决这些问题,所以当 k ITALIC> = o ITALIC>( n ITALIC> 3/2 SUPSCRPT>)。 P>