Increasing-Chord Graphs On Point Sets
Computational Geometry
2014-08-13 v1 Discrete Mathematics
Abstract
We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P. Further, we prove that, for every convex point set P with n points, there exists an increasing-chord graph with O(n log n) edges (and with no Steiner points) spanning P.
Keywords
Cite
@article{arxiv.1408.2592,
title = {Increasing-Chord Graphs On Point Sets},
author = {Hooman Reisi Dehkordi and Fabrizio Frati and Joachim Gudmundsson},
journal= {arXiv preprint arXiv:1408.2592},
year = {2014}
}
Comments
Accepted at GD '14