Optimal 3D angular resolution for low-degree graphs

Authors:
David Eppstein;Maarten Löffler;Elena Mumford;Martin Nöllenburg
Affiliations:
Department of Computer Science, University of California, Irvine;Department of Computer Science, University of California, Irvine;-;Department of Computer Science, University of California, Irvine
Venue:
GD'10 Proceedings of the 18th international conference on Graph drawing
Year:
2010

Citing 13
Cited 1

On the angular resolution of planar graphs

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Three-dimensional orthogonal graph drawing algorithms

Discrete Applied Mathematics
Efficient algorithms for Petersen's matching theorem

Journal of Algorithms
Orthogonal graph drawing

Drawing graphs
Planar Polyline Drawings with Good Angular Resolution

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Optimal three-dimensional orthogonal graph drawing in the general position model

Theoretical Computer Science
The geometric thickness of low degree graphs

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume

Algorithmica
Isometric Diamond Subgraphs

Graph Drawing
Drawing Graphs with Right Angle Crossings

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Trees with convex faces and optimal angles

GD'06 Proceedings of the 14th international conference on Graph drawing
On the perspectives opened by right angle crossing drawings

GD'09 Proceedings of the 17th international conference on Graph Drawing

Planar and poly-arc lombardi drawings

GD'11 Proceedings of the 19th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that every graph of maximum degree three can be drawn in three dimensions with at most two bends per edge, and with 120° angles between any two edge segments meeting at a vertex or a bend. We show that every graph of maximum degree four can be drawn in three dimensions with at most three bends per edge, and with 109.5° angles, i. e., the angular resolution of the diamond lattice, between any two edge segments meeting at a vertex or bend.