Graphs with large total angular resolution

by   Oswin Aichholzer, et al.

The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawing: the angular resolution, which is the minimum angle between incident edges, and the crossing resolution, which is the minimum angle between crossing edges. We consider the total angular resolution of a graph, which is the maximum total angular resolution of a straight-line drawing of this graph. We prove that, up to a finite number of well specified exceptions of constant size, the number of edges of a graph with n vertices and a total angular resolution greater than 60^∘ is bounded by 2n-6. This bound is tight. In addition, we show that deciding whether a graph has total angular resolution at least 60^∘ is NP-hard.


page 1

page 2

page 3

page 4


A Greedy Heuristic for Crossing Angle Maximization

The crossing angle of a straight-line drawing Γ of a graph G=(V, E) is t...

Lombardi Drawings of Knots and Links

Knot and link diagrams are projections of one or more 3-dimensional simp...

A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution

The crossing resolution of a non-planar drawing of a graph is the value ...

A 2D Advancing-Front Delaunay Mesh Refinement Algorithm

I present a generalization of Chew's first algorithm for Delaunay mesh r...

Quantization in Relative Gradient Angle Domain For Building Polygon Estimation

Building footprint extraction in remote sensing data benefits many impor...

Crossing Minimization in Perturbed Drawings

Due to data compression or low resolution, nearby vertices and edges of ...

Directional distributions and the half-angle principle

Angle halving, or alternatively the reverse operation of angle doubling,...