Convex drawings of 3-connected plane graphs
From MaRDI portal
Publication:879963
DOI10.1007/s00453-006-0177-6zbMath1118.68100OpenAlexW2057600466MaRDI QIDQ879963
Stefan Felsner, Mohamed Mosbah, Nicolas Bonichon
Publication date: 10 May 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-0177-6
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Greedy drawings of triangulations ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ A simple routing algorithm based on Schnyder coordinates ⋮ From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods ⋮ Straight-line drawings of 1-planar graphs ⋮ On the enumeration of plane bipolar posets and transversal structures ⋮ An annotated review on graph drawing and its applications ⋮ Small grid embeddings of 3-polytopes ⋮ Bijections for Baxter families and related objects ⋮ Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators ⋮ Triangle contact representations and duality ⋮ Succinct strictly convex greedy drawing of 3-connected plane graphs ⋮ Orthogonal surfaces and their CP-orders ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs ⋮ Schnyder woods and orthogonal surfaces ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n2) GRIDS ⋮ Drawing graphs as spanners
