Bold graph drawings
From MaRDI portal
Publication:654288
DOI10.1016/J.COMGEO.2011.06.002zbMATH Open1234.05170OpenAlexW1968439658MaRDI QIDQ654288FDOQ654288
Authors: Marc 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Applications of random sampling in computational geometry. II
- 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
- Title not available (Why is that?)
- Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
- New lower bounds for Hopcroft's problem
- Every graph admits an unambiguous bold drawing
- Drawing Planar Graphs with Large Vertices and Thick Edges
- DRAWING WITH FAT EDGES
Cited In (11)
- Title not available (Why is that?)
- 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
- Drawing Planar Graphs with Large Vertices and Thick Edges
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- 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)
