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
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
## 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
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