In this paper we characterize the class of plane graphs that can be embedded on the two-dimensional grid with at most one bend on each edge.

In this paper we characterize the class of plane graphs that can be embedded on the two- dimensional grid with at most one bend on each edge.

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid · A. Morgana, C. Mello, G. Sontacchi · Published in Discrete Applied Mathematics 30 ...

A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Applied Mathematics, 81 (1998), pp. 69-91.

We characterize the class of planar graphs that can be embedded on the two-dimensional grid with at most one bend on each edge. In addition, we provide an ...

An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid · Computer Science, Mathematics. Electron. Notes Discret. Math. · 2001.

Abstract. This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set.

We provide an O(n) time algorithm that simultaneously embeds a 3-connected planar graph and its dual on a (2n − 2) × (2n − 2) integer grid, where n is the total.

They additionally give an algorithm finding a simultaneous embedding in O(n) time on a grid of size O(n) × O(n2) such that the edges of G1 and G2 have at most ...

Jun 20, 2017 · A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Applied Mathematics, 81(1-3):69-91, 1998.