Improved Algorithms for Distance Selection and Related Problems

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Haitao Wang, Yiming Zhao
{"title":"Improved Algorithms for Distance Selection and Related Problems","authors":"Haitao Wang,&nbsp;Yiming Zhao","doi":"10.1007/s00453-025-01305-z","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set <i>P</i> of <i>n</i> points in the plane and an integer <span>\\(1 \\le k \\le \\left( {\\begin{array}{c}n\\\\ 2\\end{array}}\\right) \\)</span>, the distance selection problem is to find the <i>k</i>-th smallest interpoint distance among all pairs of points of <i>P</i>. The previously best deterministic algorithm solves the problem in <span>\\(O(n^{4/3} \\log ^2 n)\\)</span> time (Katz and Sharir in SIAM J Comput 26(5):1384–1408, 1997 and SoCG 1993). In this paper, we improve their algorithm to <span>\\(O(n^{4/3} \\log n)\\)</span> time. Using similar techniques, we also give improved algorithms on both the two-sided and the one-sided discrete Fréchet distance with shortcuts problem for two point sets in the plane. For the two-sided problem (resp., one-sided problem), we improve the previous work (Avraham et al. in ACM Trans Algorithms 11(4):29, 2015 and SoCG 2014) by a factor of roughly <span>\\(\\log ^2(m+n)\\)</span> (resp., <span>\\((m+n)^{\\epsilon }\\)</span>), where <i>m</i> and <i>n</i> are the sizes of the two input point sets, respectively. Other problems whose solutions can be improved by our techniques include the reverse shortest path problems for unit-disk graphs. Our techniques are quite general and we believe they will find many other applications in future.</p></div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"87 6","pages":"908 - 929"},"PeriodicalIF":0.9000,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithmica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00453-025-01305-z","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set P of n points in the plane and an integer \(1 \le k \le \left( {\begin{array}{c}n\\ 2\end{array}}\right) \), the distance selection problem is to find the k-th smallest interpoint distance among all pairs of points of P. The previously best deterministic algorithm solves the problem in \(O(n^{4/3} \log ^2 n)\) time (Katz and Sharir in SIAM J Comput 26(5):1384–1408, 1997 and SoCG 1993). In this paper, we improve their algorithm to \(O(n^{4/3} \log n)\) time. Using similar techniques, we also give improved algorithms on both the two-sided and the one-sided discrete Fréchet distance with shortcuts problem for two point sets in the plane. For the two-sided problem (resp., one-sided problem), we improve the previous work (Avraham et al. in ACM Trans Algorithms 11(4):29, 2015 and SoCG 2014) by a factor of roughly \(\log ^2(m+n)\) (resp., \((m+n)^{\epsilon }\)), where m and n are the sizes of the two input point sets, respectively. Other problems whose solutions can be improved by our techniques include the reverse shortest path problems for unit-disk graphs. Our techniques are quite general and we believe they will find many other applications in future.

距离选择的改进算法及相关问题
在本文中,我们提出了解决平面上点集点间距离几何优化问题的新技术。给定平面上一个包含n个点的集合P和一个整数\(1 \le k \le \left( {\begin{array}{c}n\\ 2\end{array}}\right) \),距离选择问题是在P的所有点对中找到第k个最小的点间距离。以前最好的确定性算法在\(O(n^{4/3} \log ^2 n)\)时间内解决了这个问题(Katz和Sharir in SIAM J Comput 26(5): 1384-1408, 1997和SoCG 1993)。在本文中,我们将其算法改进到\(O(n^{4/3} \log n)\)时间。利用类似的技术,我们也给出了平面上两个点集的带捷径问题的双面和单面离散距离的改进算法。对于双边问题(参见。,单侧问题),我们改进了以前的工作(Avraham et al. in ACM Trans Algorithms 11(4): 29,2015和SoCG 2014),大约提高了\(\log ^2(m+n)\)(参见:1)。, \((m+n)^{\epsilon }\)),其中m和n分别为两个输入点集的大小。其他可以通过我们的技术改进其解决方案的问题包括单位磁盘图的反向最短路径问题。我们的技术是非常通用的,我们相信它们将在未来找到许多其他应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Algorithmica
Algorithmica 工程技术-计算机:软件工程
CiteScore
2.80
自引率
9.10%
发文量
158
审稿时长
12 months
期刊介绍: Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal for practical importance or techniques. The development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential. Algorithmica covers algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming. In addition, the journal features two special sections: Application Experience, presenting findings obtained from applications of theoretical results to practical situations, and Problems, offering short papers presenting problems on selected topics of computer science.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信