Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs
From MaRDI portal
Publication:2897978
DOI10.1007/978-3-642-29700-7_2zbMath1304.68188OpenAlexW2176518969MaRDI QIDQ2897978
Publication date: 16 July 2012
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_2
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)
This page was built for publication: Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs