{"title":"Improved Algorithms for Distance Selection and Related Problems","authors":"Haitao Wang, 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.
期刊介绍:
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.