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:
Bibliographic Details
Published inInformation processing letters Vol. 54; no. 4; pp. 241 - 246
Main Authors Chrobak, M., Payne, T.H.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 26.05.1995
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Graphs
Information retrieval. Graph
Linear programming
Studies
Theoretical computing
Algorithms
Vertex(graph)
Linear time
Grid pattern
Line segment
Algorithm
Planar graph
Online AccessGet full text

Cover

More Information
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