Geometric Pattern Matching in d-Dimensional Space

@inproceedings{Chew1995GeometricPM,
  title={Geometric Pattern Matching in d-Dimensional Space},
  author={L. Paul Chew and Dorit Dor and Alon Efrat and Klara Kedem},
  booktitle={ESA},
  year={1995}
}
We show that, using the L1 metric, the minimum Hausdorr distance under translation between two point sets of cardinality n in d-dimensional space can be computed in time O(n (4d?2)=3 log 2 n) for d > 3. Thus we improve the previous time bound of O(n 2d?2 log 2 n) due to Chew and Kedem. For d = 3 we obtain a better result of O(n 3 log 2 n) time by exploiting the fact that the union of n axis-parallel unit cubes can be decomposed into O(n) disjoint axis-parallel boxes. We prove that the number of… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…