Graph drawings that use few bends per edge, restrict edge slopes, and maintain good angular resolution play an important role in applications such as software engineering and information visualization, where clarity and readability are crucial. In such drawings, each edge is represented as a polyline with a small number of segments, each chosen from a limited set of allowable slopes, while the angles between consecutive edges incident to a vertex are kept as large as possible. When the input graph is planar, the drawing is additionally required to preserve planarity, as expected in this setting.

Research in this area is particularly appealing because it lies at the intersection of algorithms, combinatorics, and geometry, connecting theoretical challenges with practical visualization goals. In this line of research, our group has received funding through IKYDA-2025 program for the promotion of exchanges and scientific cooperation between Greece and Germany, supported by the Greek State Scholarships Foundation (IKY) and the German Academic Exchange Service (DAAD), to carry out a two-year collaboration (2025–2027) with Prof. P. Kindermann’s research group at the University of Trier, Germany, aimed at advancing research along the following directions.