An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid Original Research Article

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 addition, we provide an algorithm that either detects a forbidden configuration or generates an embedding with at most one bend on each edge.