Embedding Ray Intersection Graphs and Global Curve Simplification
Computational Geometry
2021-09-02 v1
Abstract
We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embedding to show that the global curve simplification problem for the directed Hausdorff distance is NP-hard. In this problem, we are given a polygonal curve and the goal is to find a second polygonal curve such that the directed Hausdorff distance from to is at most a given constant, and the complexity of is as small as possible.
Cite
@article{arxiv.2109.00042,
title = {Embedding Ray Intersection Graphs and Global Curve Simplification},
author = {Mees van de Kerkhof and Irina Kostitsyna and Maarten Löffler},
journal= {arXiv preprint arXiv:2109.00042},
year = {2021}
}
Comments
Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)