Bold graph drawings

DOI10.1016/j.comgeo.2011.06.002zbMath1234.05170OpenAlexW1968439658MaRDI QIDQ654288

Marc J. van Kreveld

Publication date: 28 December 2011

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.06.002

zbMATH Keywords

graph drawingedge and vertex sizeplanar straight-line drawing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Limitations on realistic hyperbolic graph drawing ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Every Graph Admits an Unambiguous Bold Drawing ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Geometry and Generation of a New Graph Planarity Game

Cites Work

• Unnamed Item
• Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• New lower bounds for Hopcroft's problem
• Applications of random sampling in computational geometry. II
• Every Graph Admits an Unambiguous Bold Drawing
• An optimal algorithm for intersecting line segments in the plane
• Drawing Planar Graphs with Large Vertices and Thick Edges
• DRAWING WITH FAT EDGES

This page was built for publication: Bold graph drawings