Convex drawings of 3-connected plane graphs

Cited In (27)

A simple routing algorithm based on Schnyder coordinates
From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods
CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n²) GRIDS
Bijections for Baxter families and related objects
Succinct strictly convex greedy drawing of 3-connected plane graphs
On the enumeration of plane bipolar posets and transversal structures
An annotated review on graph drawing and its applications
Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
Straight-line drawings of 1-planar graphs
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
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
A Schnyder-type drawing algorithm for 5-connected triangulations
Schnyder woods and orthogonal surfaces
Manipulating weights to improve stress-graph drawings of 3-connected planar graphs
Drawing graphs as spanners
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
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)