Error-tolerant geometric graph similarity and matching

Abstract

Geometric graph matching is the process of evaluating the similarity between geometric graphs, where each vertex has an associated coordinate point in a plane. Exact matching computes a strict correspondence between two geometric graphs, whereas in error-tolerant matching an approximate similarity between two geometric graphs is computed. In this paper, we present an approach to error-tolerant graph matching using geometric graphs. We introduce the vertex distance (dissimilarity) and edge distance between two geometric graphs and use it to compute graph distance. Finally, we use graph distance to perform error-tolerant geometric graph matching. © 2019 Elsevier B.V.