Skip to Main Content
In this paper we present method for finding similarities in a pair of three-dimensional objects. The method involves obtaining boundary cubes approximations to the two objects, see (Maple and Donafee, 2002). The boundary cubes algorithm is a modification to the well-known marching cubes algorithm of Lorensen and Cline (1987). Having obtained the approximations we can apply exact and inexact graph-matching algorithms to quantify the similarity between two objects. This paper considers methods for exact and inexact graph matching and provides novel and efficient algorithms for graph matching applied to boundary cubes representations.
Date of Conference: 14-16 July 2004