5 citations · 5 across the 4 of their papers we have counts for
1 paper · 2 filters
Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati
A graph drawing is greedy if, for every ordered pair of vertices (x,y), there is a path from x to y such that the Euclidean distance to y decreases monotonically…