Geometric Graph Matching
Shri Prakash Dwivedi, Ravi Shankar Singh · 2025
This chapter focuses on geometric graph matching, where the spatial or geometric arrangement of nodes plays a crucial role in determining graph similarity. It explores methods that incorporate geometric features, such as coordinates and distances, into the matching process. The chapter discusses rigid and non-rigid transformations, affine invariance, and shape-preserving mappings. Various geometric graph matching techniques are compared in terms of their resilience to noise, occlusions, and geometric distortions. The integration of geometric constraints into structural matching demonstrates significant improvements in applications involving shapes, objects, and spatial data.