Improvements on bottleneck matching and related problems using geometry

Alon Efrat, Alon Itai

Research output: Contribution to conferencePaperpeer-review

33 Scopus citations


Let A and B be two sets of n objects in Rd. We propose to use bottleneck matching as a convenient way for measuring the resemblance between them, and present several algorithms for computing, as well as approximating, this resemblance. The running time of all these algorithms is close to O(n1.5). For instance, if the objects are points in the plane, the running time is O(n1.5 log n). We also consider the problem of finding a translation of B that maximizes the resemblance to A under the bottleneck matching criterion. When A and B are point-sets in the plane, we present an O(n5 log n) time algorithm for determining whether for some translated copy the resemblance gets below a given ρ, improving the previous result of Alt, Mehlhorn, Wagener and Welzl by a factor of almost n. We use this result to compute the smallest such ρ in time O(n5 log2 n), and give an efficient approximation scheme for this problem.

Original languageEnglish (US)
Number of pages10
StatePublished - Jan 1 1996
Externally publishedYes
EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
Duration: May 24 1996May 26 1996


OtherProceedings of the 1996 12th Annual Symposium on Computational Geometry
CityPhiladelphia, PA, USA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'Improvements on bottleneck matching and related problems using geometry'. Together they form a unique fingerprint.

Cite this