Three dimensional graph drawing with fixed vertices and one bend per edge
Abstract
We prove that for every graph G, given fixed locations for the vertices of G in Z3, there is a three-dimensional grid-drawing of G with one bend per edge. The best previous bound was three bends per edge.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.