A linear-time algorithm for drawing a planar graph on a grid
We present a linear-time algorithm that, given an n-vertex planar graph G, finds an embedding of G into a (2 n − 4) × ( n − 2) grid such that the edges of G are straight-line segments.
Saved in:
Published in | Information processing letters Vol. 54; no. 4; pp. 241 - 246 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
26.05.1995
Elsevier Science Elsevier Sequoia S.A |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We present a linear-time algorithm that, given an
n-vertex planar graph
G, finds an embedding of
G into a (2
n − 4) × (
n − 2) grid such that the edges of
G are straight-line segments. |
---|---|
ISSN: | 0020-0190 1872-6119 |
DOI: | 10.1016/0020-0190(95)00020-D |