An algorithm for optimal free-form object matching

Kwang Hee Ko, Takashi Maekawa, Nicholas M. Patrikalakis*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

65 Citations (Scopus)


A novel method of matching for 3-D free-form objects (points vs. surface and surface vs. surface) is proposed. The method formulates the problem in terms of solution of a non-linear polynomial equation system, which can be solved robustly by the Interval Projected Polyhedron (IPP) algorithm. Two intrinsic surface properties, the Gaussian and the mean curvatures, are used as object features for matching. The related iso-curvature lines are used to establish the correspondence between two objects. The intersection points of these iso-curvature lines are calculated and sorted out to satisfy the Euclidean constraints from which the translation and rotation transformations are estimated. The performance of the proposed algorithm is also analyzed. This approach can cover global and partial matching, and be applied to automated inspection, copyright protection of NURBS models, and object recognition. Examples illustrate our technique.

Original languageEnglish
Pages (from-to)913-923
Number of pages11
JournalCAD Computer Aided Design
Issue number10
Publication statusPublished - 2003 Sep 1
Externally publishedYes


  • Correspondence search
  • Intrinsic watermarking
  • Localization
  • Partial matching
  • Partial surface overlap
  • Registration

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'An algorithm for optimal free-form object matching'. Together they form a unique fingerprint.

Cite this