Work

Optimal 3D Angular Resolution for Low-Degree Graphs

Year: 2013

Type: article

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-degree 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-degree angles, i.e., the angular resolution of the diamond lattice, between any two edge segments meeting at a vertex or bend.

Source: Journal of Graph Algorithms and Applications

DOI: 10.7155/jgaa.00290

Authors: David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2762846124

FWCI: 3.076

Cites:

Cited by: 6

Related to: