Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints

DOI10.1007/978-3-642-00219-9_26zbMath1213.68457OpenAlexW2159264417MaRDI QIDQ3611859

Martin Mader, Seok-Hee Hong

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_26

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for drawing a planar graph on a grid
• How to draw a planar graph on a grid
• An algorithm for straight-line drawing of planar graphs
• Drawing planar graphs using the canonical ordering
• Drawing Planar Graphs with Large Vertices and Thick Edges
• Drawing graphs. Methods and models