Drawing Planar Graphs with Large Vertices and Thick Edges

DOI10.7155/JGAA.00078MaRDI QIDQ4679077zbMATH OpenOpenAlexFDO

Authors Chris Riley, Gill Barequet, Michael T. Goodrich

Publication date 25 May 2005

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/51530

zbMATH Keywords

linear-time algorithm

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Drawing graphs with large vertices and thick edges.
• DRAWING WITH FAT EDGES
• scientific article; zbMATH DE number 2084275
• An algorithm for straight-line drawing of planar graphs
• Bold graph drawings

Cited in

(13)

• Limitations on realistic hyperbolic graph drawing
• Convex grid drawings of planar graphs with constant edge-vertex resolution
• Grid drawings of graphs with constant edge-vertex resolution
• scientific article; zbMATH DE number 2084275 (Why is no real title available?)
• Drawing Graphs in the Plane with High Resolution
• Every graph admits an unambiguous bold drawing
• Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
• Drawing planar graphs with many collinear vertices
• DRAWING WITH FAT EDGES
• Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
• Drawing graphs with large vertices and thick edges.
• Convex grid drawings of planar graphs with constant edge-vertex resolution
• Bold graph drawings

This page was built for publication: Drawing Planar Graphs with Large Vertices and Thick Edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679077)