An algorithm for 1-bend embeddings of pl
✍
Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 491 KB
In this paper we characterize the class of plane graphs that can be embedded on the twodimensional grid with at most one bend on each edge. In addition, we provide an algorithm that either detects a forbidden conÿguration or generates an embedding with at most one bend on each edge.