Measuring the Similarity of Geometric Graphs

  • Authors:
  • Otfried Cheong;Joachim Gudmundsson;Hyo-Sil Kim;Daria Schymura;Fabian Stehn

  • Affiliations:
  • KAIST, Korea;NICTA, Australia;KAIST, Korea;FU Berlin, Germany;FU Berlin, Germany

  • Venue:
  • SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.