Getting around a lower bound for the minimum Hausdorff distance

L. Paul Chew, Klara Kedem

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

We consider the following geometric pattern matching problem: find the minimum Hausdorff distance between two point sets under translation with L1 or L as the underlying metric. Huttenlocher, Kedem and Sharir have shown that this minimum distance can be found by constructing the upper envelope of certain Voronoi surfaces. Further, they show that if the two sets are each of cardinality n then the complexity of the upper envelope of such surfaces is Ω(n3). We examine the question of whether one can get around this cubic lower bound, and show that under the L1 and L metrics, the time to compute the minimum Hausdorff distance between two point sets is O(n2 log2 n).

Original languageEnglish
Pages (from-to)197-202
Number of pages6
JournalComputational Geometry: Theory and Applications
Volume10
Issue number3
DOIs
StatePublished - 1 Jan 1998

Keywords

  • Algorithm
  • Approximate matching
  • Geometric pattern matching
  • Optimization
  • Segment tree

Fingerprint

Dive into the research topics of 'Getting around a lower bound for the minimum Hausdorff distance'. Together they form a unique fingerprint.

Cite this