Combinatorial and Experimental Methods for Approximate Point Pattern Matching

@article{Gavrilov2003CombinatorialAE,
  title={Combinatorial and Experimental Methods for Approximate Point Pattern Matching},
  author={Martin Gavrilov and Piotr Indyk and Rajeev Motwani and Suresh Venkatasubramanian},
  journal={Algorithmica},
  year={2003},
  volume={38},
  pages={59-90}
}
Point pattern matching is an important problem in computational geometry, with applications in areas like computer vision, object recognition, molecular modeling, and image registration. Traditionally, it has been studied in an exact formulation, where the input point sets are given with arbitrary precision. This leads to algorithms that typically have running times of the order of high-degree polynomials, and require robust calculations of intersection points of high-degree surfaces. We study… CONTINUE READING

Similar Papers

Loading similar papers…