𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar Polyline Drawings via Graph Transformations

✍ Scribed by Huaming Zhang


Publisher
Springer
Year
2008
Tongue
English
Weight
499 KB
Volume
57
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Framework for Drawing Planar Graphs wi
✍ Michael T. Goodrich; Christopher G. Wagner πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 204 KB

We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties of such drawings, including aspect ratio, vertex resolution, edge length, edge separation, and edge curvature, as well

Monotone drawings of planar graphs
✍ JΓ‘nos Pach; GΓ©za TΓ³th πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__‐monotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__‐coordinates of the vertices remain unchanged and the edges become non‐cross

An algorithm for drawing planar graphs
✍ Bor Plestenjak πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 382 KB πŸ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s