Square-Orthogonal Drawing with Few Bends per Edge

DOI10.1007/978-3-642-38768-5_33zbMath1381.68223OpenAlexW88203981WikidataQ62041780 ScholiaQ62041780MaRDI QIDQ4925252

Sheung-Hung Poon, Yu-An Lin

Publication date: 11 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_33

Mathematics Subject Classification ID

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

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
• Drawing Graphs in the Plane with High Resolution
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Universality considerations in VLSI circuits
• Computing orthogonal drawings with the minimum number of bends

This page was built for publication: Square-Orthogonal Drawing with Few Bends per Edge