๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Algorithm for Straight-Line Drawing of Planar Graphs

โœ Scribed by D. Harel; M. Sardas

Publisher
Springer
Year
1998
Tongue
English
Weight
200 KB
Volume
20
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for straight-line represent
An algorithm for straight-line representation of simple planar graphs
โœ Lin Woo ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the

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

3D straight-line grid drawing of 4-color
3D straight-line grid drawing of 4-colorable graphs
โœ Tiziana Calamoneri; Andrea Sterbini ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely, we show how to make a 3D straight-line grid drawing of 4-colorable graphs in 0( n\*) volume. Moreover, we prove that each bipartite graph needs at least a( n3/\*) volume. @