A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Getting around a lower bound for the minimum Hausdorff distance
1998
Computational geometry
We consider the following geometric pattern matching problem: find the minimum Hausdorff distance between two point sets under translation with Ll 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 f2(n3). We examine the question of whether one
doi:10.1016/s0925-7721(97)00032-1
fatcat:zwbde6cxxbf7jdpdmdfgoqcfmu