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

DOI10.1016/J.TCS.2014.02.012zbMATH Open1360.68650DBLPjournals/tcs/LinP14OpenAlexW2079543135WikidataQ62041745 ScholiaQ62041745MaRDI QIDQ744098FDOQ744098

Sheung-Hung Poon, Yuan Lin

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

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

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)

Cites Work

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

Cited In (1)

• SOFSEM 2005: Theory and Practice of Computer Science

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)