Distance measures for embedded graphs

DOI10.1016/J.COMGEO.2020.101743MaRDI QIDQ1984601zbMATH OpenOpenAlexFDO

Authors Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk

Publication date 16 September 2021

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.09095, https://drops.dagstuhl.de/opus/volltexte/2019/11551/

zbMATH Keywords

embedded graphsFréchet distancegraph comparison

Mathematics Subject Classification ID

Computer science (68-XX) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)

Recommendations

• Matching planar maps
• scientific article; zbMATH DE number 2079389
• Fréchet-Distance on Road Networks
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• On the complexity of embedding planar graphs to minimize certain distance measures

Cites work

• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Constructing street networks from GPS trajectories
• scientific article; zbMATH DE number 910922 (Why is no real title available?)
• Map Construction Algorithms
• Matching planar maps

Cited in

(10)

• A linear-space algorithm for distance preserving graph embedding
• Closest paths in graph drawings under an elastic metric
• On the estimation of latent distances using graph distances
• Distances between immersed graphs: metric properties
• scientific article; zbMATH DE number 1890143 (Why is no real title available?)
• scientific article; zbMATH DE number 1445367 (Why is no real title available?)
• scientific article; zbMATH DE number 6780707 (Why is no real title available?)
• On length-sensitive Fréchet similarity
• Distance measures for geometric graphs
• Minimum-complexity graph simplification under the Fréchet-like distance

This page was built for publication: Distance measures for embedded graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1984601)