Distance Measures for Embedded Graphs

@inproceedings{Akitaya2019DistanceMF,
  title={Distance Measures for Embedded Graphs},
  author={Hugo A. Akitaya and M. Buchin and Bernhard Kilgus and Stef Sijben and C. Wenk},
  booktitle={ISAAC},
  year={2019}
}
  • Hugo A. Akitaya, M. Buchin, +2 authors C. Wenk
  • Published in ISAAC 2019
  • Mathematics, Computer Science
  • We introduce new distance measures for comparing embedded graphs based on the Fr\'echet distance and the weak Fr\'echet distance. These distances take the combinatorial structure as well as the geometric embeddings of the graphs into account. Our distance measures are motivated by the comparison of road networks, for instance, to evaluate the quality of a map construction algorithm, a task for which suitable distance measures are currently missing. In this paper, we present a general… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES
    A Path-Based Distance for Street Map Comparison
    • 18
    • PDF
    A Path-Based Distance for Street Map Comparison
    • 18
    • PDF
    Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails
    • 188
    • PDF
    Matching planar maps
    • 191
    • PDF
    Computing the Fréchet distance between two polygonal curves
    • 778
    • PDF