Bold graph drawings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- An optimal algorithm for intersecting line segments in the plane
- Applications of random sampling in computational geometry. II
- DRAWING WITH FAT EDGES
- Drawing Planar Graphs with Large Vertices and Thick Edges
- Every graph admits an unambiguous bold drawing
- New lower bounds for Hopcroft's problem
- Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
Cited in
(11)- scientific article; zbMATH DE number 2084275 (Why is no real title available?)
- Every graph admits an unambiguous bold drawing
- Geometry and generation of a new graph planarity game
- Limitations on realistic hyperbolic graph drawing
- Grid drawings of graphs with constant edge-vertex resolution
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Drawing Planar Graphs with Large Vertices and Thick Edges
- Drawing graphs with large vertices and thick edges.
- Every graph admits an unambiguous bold drawing
- DRAWING WITH FAT EDGES
- Convex grid drawings of planar graphs with constant edge-vertex resolution
This page was built for publication: Bold graph drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654288)