Non-planar square-orthogonal drawing with few-bend edges

DOI10.1016/J.TCS.2014.02.012MaRDI QIDQ744098zbMATHOpenAlexDBLPWikidataFDO

Authors Yuan Lin, Sheung-Hung Poon

Publication date 6 October 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.02.012

zbMATH Keywords

NP-completenessbend numbernon-planar drawingsquare-orthogonal drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Square-orthogonal drawing with few bends per edge
• A better heuristic for orthogonal graph drawings
• Orthogonal Drawings of Plane Graphs Without Bends
• scientific article; zbMATH DE number 2084292
• Algorithms for area-efficient orthogonal drawing

Cites work

• A better heuristic for orthogonal graph drawings
• A simple linear time algorithm for proper box rectangular drawings of plane graphs
• Algorithms for area-efficient orthogonal drawing
• Area-efficient static and incremental graph drawings
• Drawing graphs on rectangular grids
• Efficient orthogonal drawings of high degree graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends

Cited in

(2)

• SOFSEM 2005: Theory and Practice of Computer Science
• Square-orthogonal drawing with few bends per edge

This page was built for publication: Non-planar square-orthogonal drawing with few-bend edges

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