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

DOI10.1016/j.tcs.2014.02.012zbMath1360.68650OpenAlexW2079543135WikidataQ62041745 ScholiaQ62041745MaRDI QIDQ744098

Sheung-Hung Poon, Yu-An 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

zbMATH Keywords

NP-completenessbend numbernon-planar drawingsquare-orthogonal drawing

Mathematics Subject Classification ID

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

Cites Work

• Area-efficient static and incremental graph drawings
• Algorithms for area-efficient orthogonal drawing
• A better heuristic for orthogonal graph drawings
• Drawing graphs on rectangular grids
• Efficient orthogonal drawings of high degree graphs
• A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends

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