Graphic matching based on constrained Voronoi diagrams
Hailin Zhang, Hong Yan · 2003
This paper presents a novel approach to the inexact graph matching problem based on local relationships. The constrained Voronoi diagram (CVD) is used to partition a graph into a set of polygons. The CVD provides a convenient and robust neighborhood representation for the graph. In the proposed method, Voronoi neighboring relationships as well as geometrical characteristics are used to detect potentially matching pairs of objects. This method is implemented and tested in the matching process for 2D cartoon key frames with encouraging results.