𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs

✍ Scribed by Seok-Hee Hong; Peter Eades

Publisher
Springer
Year
2005
Tongue
English
Weight
363 KB
Volume
44
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Monotone drawings of planar graphs
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
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