On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings

DOI10.1007/s00453-018-0523-5zbMath1421.68106arXiv1708.09197MaRDI QIDQ1741861

Xianqiang Yang

Publication date: 7 May 2019

Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09197

zbMATH Keywords

graph drawing; octilinear; smooth orthogonal

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)