SHAPE MATCHING UNDER RIGID MOTION

MPhil Thesis Defence


Title: "SHAPE MATCHING UNDER RIGID MOTION"

By

Mr. Chi-Kit Lam


Abstract

We present an improved algorithm to efficiently match two polygons of 
total complexity n. Our algorithm finds a translation vector that 
approximately maximizes the overlap area of the two polygons under 
translation in ˜O(n2ε-3) time, within an error of ε times the minimum of 
the area of the two polygons. For the case of rigid motions, our method 
gives a ˜O(n3ε-4) algorithm. These results compare favorably with the 
original algorithm by Cheong et al. [16], which runs in ˜O(n2ε-4) and 
˜O(n3ε-8) respectively.


Date:			Monday, 25 June 2012

Time:			10:00am – 12:00noon

Venue:			Room 3501
 			Lifts 25/26

Committee Members:	Prof. Siu-Wing Cheng (Supervisor)
 			Prof. Mordecai Golin (Chairperson)
 			Dr. Sunil Arya


**** ALL are Welcome ****