Periodic Planar Straight-Frame Drawings with Polynomial Resolution
We present a new algorithm to compute periodic (planar) straight-line drawings of toroidal graphs. Our algorithm is the first to achieve two important aesthetic criteria: the drawing fits in a straight rectangular frame, and the grid area is polynomial, precisely the grid size is O(n 4×n 4). This solves one of the main open problems in a recent paper by Duncan et al. .
KeywordsShift Algorithm Outer Frame Schnyder Wood Outer Vertex Toroidal Graph
Unable to display preview. Download preview PDF.