2 citations · 6 across the 6 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2023★ 1 cited
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta +2
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to…
cs.CG2016★ 2 cited
1-Bend RAC Drawings of 1-Planar Graphs
Walter Didimo, Giuseppe Liotta, Saeed Mehrabi +1
A graph is 1-planar if it has a drawing where each edge is crossed at most once. A drawing is RAC (Right Angle Crossing) if the edges cross only at right angles. The relationships…