License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2018.73
URN: urn:nbn:de:0030-drops-87865
Go to the corresponding LIPIcs Volume Portal

Xue, Jie ; Li, Yuan ; Rahul, Saladi ; Janardan, Ravi

New Bounds for Range Closest-Pair Problems

LIPIcs-SoCG-2018-73.pdf (0.7 MB)


Given a dataset S of points in R^2, the range closest-pair (RCP) problem aims to preprocess S into a data structure such that when a query range X is specified, the closest-pair in S cap X can be reported efficiently. The RCP problem can be viewed as a range-search version of the classical closest-pair problem, and finds applications in many areas. Due to its non-decomposability, the RCP problem is much more challenging than many traditional range-search problems. This paper revisits the RCP problem, and proposes new data structures for various query types including quadrants, strips, rectangles, and halfplanes. Both worst-case and average-case analyses (in the sense that the data points are drawn uniformly and independently from the unit square) are applied to these new data structures, which result in new bounds for the RCP problem. Some of the new bounds significantly improve the previous results, while the others are entirely new.

BibTeX - Entry

  author =	{Jie Xue and Yuan Li and Saladi Rahul and Ravi Janardan},
  title =	{{New Bounds for Range Closest-Pair Problems}},
  booktitle =	{34th International Symposium on Computational Geometry (SoCG 2018)},
  pages =	{73:1--73:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-066-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{99},
  editor =	{Bettina Speckmann and Csaba D. T{\'o}th},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-87865},
  doi =		{10.4230/LIPIcs.SoCG.2018.73},
  annote =	{Keywords: Closest-pair, Range search, Candidate pairs, Average-case analysis}

Keywords: Closest-pair, Range search, Candidate pairs, Average-case analysis
Collection: 34th International Symposium on Computational Geometry (SoCG 2018)
Issue Date: 2018
Date of publication: 08.06.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI