On Planar Greedy Drawings of 3-Connected Planar Graphs

Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati

A graph drawing is $\text{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…