Bold graph drawings

Authors:
Marc van Kreveld
Affiliations:
Department of Information and Computing Sciences, Utrecht University, The Netherlands
Venue:
Computational Geometry: Theory and Applications
Year:
2011

Citing 4
Cited 1

Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
An optimal algorithm for intersecting line segments in the plane

Journal of the ACM (JACM)
A fast planar partition algorithm. I

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments

Computer-Aided Design

Every graph admits an unambiguous bold drawing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges and zero-size vertices exist only in theory. Let r denote the radius of the disks that show vertices and w the width of edges. We give a list of conditions that make such a drawing good and that apply to not necessarily planar graphs. We show that if r=w, a vertex can have any degree. We also give an algorithm that, for a given drawing and values for r and w, determines whether the bold drawing satisfies the conditions. Furthermore, we show how to maximize r and/or w without violating the conditions in polynomial time.