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

2016/06/14 by David R. Wood, Wood, David R.
Computer Science · #Advanced Graph Theory Research #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.CG #cs.DM

paper · pdf · doi:10.48550/arxiv.1606.09188

arxiv created 2016/06/14 · openalex publication_date 2016/06/14 · arxiv updated 2016/06/30 · openalex created_date 2016/07/22 · openalex updated_date 2026/07/28

Abstract

We prove that for every graph G, given fixed locations for the vertices of G in ℤ³, there is a three-dimensional grid-drawing of G with one bend per edge. The best previous bound was three bends per edge.

Related

• Graph drawings with one bend and few slopes
• The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations
• One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Strictly-convex drawings of 3-connected planar graphs