Convex Grid Drawings of Plane Graphs with Rectangular Contours
From MaRDI portal
Publication:5459109
DOI10.1007/11940128_15zbMath1135.68520OpenAlexW2168588915MaRDI QIDQ5459109
Akira Kamada, Kazuyuki Miura, Takao Nishizeki
Publication date: 24 April 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11940128_15
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
This page was built for publication: Convex Grid Drawings of Plane Graphs with Rectangular Contours