Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints

DOI10.1007/978-3-642-00219-9_26MaRDI QIDQ3611859zbMATH OpenOpenAlexFDO

Authors Seok-Hee Hong, Martin Mader

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

Recommendations

• Drawing planar graphs on \(\frac{8}{9}n^2\) area
• Rectangular grid drawings of plane graphs
• scientific article; zbMATH DE number 1990911
• Drawing planar graphs using the canonical ordering
• An algorithm for straight-line drawing of planar graphs

Cites work

• A linear-time algorithm for drawing a planar graph on a grid
• An algorithm for straight-line drawing of planar graphs
• Drawing graphs. Methods and models
• Drawing planar graphs using the canonical ordering
• Drawing Planar Graphs with Large Vertices and Thick Edges
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)

This page was built for publication: Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints

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