Convex drawings of 3-connected plane graphs
From MaRDI portal
Publication:879963
DOI10.1007/S00453-006-0177-6zbMATH Open1118.68100OpenAlexW2057600466MaRDI QIDQ879963FDOQ879963
Authors: Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (33)
- A simple routing algorithm based on Schnyder coordinates
- Bijections for Baxter families and related objects
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- On the enumeration of plane bipolar posets and transversal structures
- From two-way to one-way finite automata -- three regular expression-based methods
- An annotated review on graph drawing and its applications
- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
- Graph Drawing
- Straight-line drawings of 1-planar graphs
- Title not available (Why is that?)
- Greedy drawings of triangulations
- Triangle contact representations and duality
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- Minimum-segment convex drawings of 3-connected cubic plane graphs
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
- A Schnyder-type drawing algorithm for 5-connected triangulations
- Strictly-convex drawings of 3-connected planar graphs
- Schnyder woods and orthogonal surfaces
- Manipulating weights to improve stress-graph drawings of 3-connected planar graphs
- Drawing graphs as spanners
- Strictly convex drawings of planar graphs
- Small grid embeddings of 3-polytopes
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Drawing outerplanar graphs using three edge lengths
- Convex drawings of internally triconnected plane graphs on \(O(n^{2})\) grids
- Orthogonal surfaces and their CP-orders
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Title not available (Why is that?)
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
This page was built for publication: Convex drawings of 3-connected plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879963)
