Skip to main navigation Skip to search Skip to main content

Practical methods for approximate geometric pattern matching under rigid motions

  • Johns Hopkins University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

47 Scopus citations

Abstract

We present practical methods for approximate geometric pattern matching in d-dimensions along with experimental data regarding the quality of matches and running times of these methods verses those of a branch-and-bound search. Our methods are faster than previous methods but still produce good matches.

Original languageEnglish
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherPubl by ACM
Pages103-112
Number of pages10
ISBN (Print)0897916484, 9780897916486
DOIs
StatePublished - 1994
EventProceedings of the 10th Annual Symposium on Computational Geometry - Stony Brook, NY, USA
Duration: Jun 6 1994Jun 8 1994

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Conference

ConferenceProceedings of the 10th Annual Symposium on Computational Geometry
CityStony Brook, NY, USA
Period06/6/9406/8/94

Fingerprint

Dive into the research topics of 'Practical methods for approximate geometric pattern matching under rigid motions'. Together they form a unique fingerprint.

Cite this