
A Greedy Heuristic for Crossing Angle Maximization
The crossing angle of a straightline drawing Γ of a graph G=(V, E) is t...
read it

Lombardi Drawings of Knots and Links
Knot and link diagrams are projections of one or more 3dimensional simp...
read it

A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
The crossing resolution of a nonplanar drawing of a graph is the value ...
read it

A 2D AdvancingFront Delaunay Mesh Refinement Algorithm
I present a generalization of Chew's first algorithm for Delaunay mesh r...
read it

Quantization in Relative Gradient Angle Domain For Building Polygon Estimation
Building footprint extraction in remote sensing data benefits many impor...
read it

Decoupling Respiratory and Angular Variation in Rotational Xray Scans Using a Prior Bilinear Model
Datadriven respiratory signal extraction from rotational Xray scans ha...
read it

Crossing Minimization in Perturbed Drawings
Due to data compression or low resolution, nearby vertices and edges of ...
read it
Graphs with large total angular resolution
The total angular resolution of a straightline 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 straightline 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 2n6. This bound is tight. In addition, we show that deciding whether a graph has total angular resolution at least 60^∘ is NPhard.
READ FULL TEXT
Comments
There are no comments yet.