English

Three dimensional graph drawing with fixed vertices and one bend per edge

Computational Geometry 2016-06-30 v1 Discrete Mathematics

Abstract

We prove that for every graph GG, given fixed locations for the vertices of GG in Z3\mathbb{Z}^3, there is a three-dimensional grid-drawing of GG with one bend per edge. The best previous bound was three bends per edge.

Keywords

Cite

@article{arxiv.1606.09188,
  title  = {Three dimensional graph drawing with fixed vertices and one bend per edge},
  author = {David R. Wood},
  journal= {arXiv preprint arXiv:1606.09188},
  year   = {2016}
}
R2 v1 2026-06-22T14:38:43.282Z