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

平方的最小权矩阵与最近对矩阵的等价性

Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares

Abrar Kazi, Michiel Smid

摘要:

令$S$是平面中的一组$n$加权点,并且令$R$是平面中的查询范围。在范围最接近对问题中,我们希望报告集合$R \cap S$中最接近的对。在范围最小权问题中,我们希望报告集合$R \cap S$中任何点的最小权。我们表明,这两个查询问题是等价的查询范围是广场,数据结构有$Ω(\log n)$查询时间。因此,我们得到了新的数据结构的范围最近对查询的平方。

英文摘要:

Let $S$ be a set of $n$ weighted points in the plane and let $R$ be a query range in the plane. In the range closest pair problem, we want to report the closest pair in the set $R \cap S$. In the range minimum weight problem, we want to report the minimum weight of any point in the set $R \cap S$. We show that these two query problems are equivalent for query ranges that are squares, for data structures having $Ω(\log n)$ query times. As a result, we obtain new data structures for range closest pair queries with squares.

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

↑