Hausdorff Distance under Translation for Points , Disks , and Balls ∗

@inproceedings{Agarwal2002HausdorffDU,
  title={Hausdorff Distance under Translation for Points , Disks , and Balls ∗},
  author={Pankaj K. Agarwal and Sariel Har-Peled and Micha Sharir and Yusu Wang},
  year={2002}
}
Let A and B be two sets of balls in Rd, d = 2, 3. We measure similarity between A and B by computing the minimum Hausdorff distance between A + t and B, where the minimum is taken either over all vectors t ∈ Rd or over the vectors t such that A+t and B do not intersect. These problems arise in measuring similarity between the shapes of two proteins. We propose a number of exact and approximation algorithms for these problems. Since Hausdorff distance is sensitive to out-liers, we also propose… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
8 Citations
31 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Feature extraction and registration: An overview

  • S. Seeger, X. Laboureux
  • Principles of 3D Image Analysis and Synthesis,
  • 2002

Nussinov . Principles of docking : An overview of search algorithms and a guide to scoring functions

  • R.
  • Proteins : Structure , Function , and Genetics
  • 2002

Similar Papers

Loading similar papers…