Can I read A Linear Algorithm for 2-Bend Embeddings of Planar Graphs in the Two-dimensional Grid on EtoBox?

A Linear Algorithm for 2-Bend Embeddings of Planar Graphs in the Two-dimensional Grid by Yanpei Liu; Aurora Morgana; Bruno Simeone is a Computer Science article available to read on EtoBox.

What is A Linear Algorithm for 2-Bend Embeddings of Planar Graphs in the Two-dimensional Grid about?

In this paper we describe a linear algorithm for embedding planar graphs in the rectilinear two-dimensional grid, where vertices are grid points and edges are noncrossing grid paths. The main feature of our algorithm is that each edge is guaranteed to have at most 2 bends (with the single exception of the octahedron for which 3 bends are needed). The total number of bends is at most 2n + 4 if the graph is biconnected and at most (:)n in the general case. The area is (n + 1)2 in the worst case. This problem has several applications to VLSI circuit design, aesthetic layout of diagrams, computational geometry.

Who reads A Linear Algorithm for 2-Bend Embeddings of Planar Graphs in the Two-dimensional Grid?

Author

Yanpei Liu; Aurora Morgana; Bruno Simeone

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)

Published

1998

Language

EN

Field

Computer Science (Physical Sciences)