O(1)-Distortion Planar Emulators for String Graphs
Data Structures and Algorithms
2025-10-27 v1 Computational Geometry
Discrete Mathematics
Combinatorics
Metric Geometry
Abstract
We show that every unweighted string graph has an -distortion planar emulator: that is, there exists an (edge-weighted) planar graph with , such that every pair of vertices satisfies
Keywords
Cite
@article{arxiv.2510.21700,
title = {O(1)-Distortion Planar Emulators for String Graphs},
author = {Hsien-Chih Chang and Jonathan Conroy and Zihan Tan and Da Wei Zheng},
journal= {arXiv preprint arXiv:2510.21700},
year = {2025}
}