Drawing Planar Graphs with Large Vertices and Thick Edges

DOI10.7155/jgaa.00078zbMath1068.68099OpenAlexW2114443956MaRDI QIDQ4679077

Chris Riley, Michael T. Goodrich, Gill Barequet

Publication date: 25 May 2005

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

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

zbMATH Keywords

linear-time algorithm

Mathematics Subject Classification ID

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

Related Items (7)

Limitations on realistic hyperbolic graph drawing ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Every Graph Admits an Unambiguous Bold Drawing ⋮ Bold graph drawings ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints

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