Greedy forwarding tries to bring the message closer to the destination in each step using only local information.
Alternatively, one can consider another notion of progress, namely the projected distance on the source-destination-line (MFR, NFP), or the minimum angle between neighbor and destination (Compass Routing).
It is known that the basic greedy strategy and MFR are loop free, while NFP and Compass Routing are not.
Then, face routing helps to recover from that situation and find a path to another node, where greedy forwarding can be resumed.
[8] Although originally developed as a routing scheme that uses the physical positions of each node, geographic routing algorithms have also been applied to networks in which each node is associated with a point in a virtual space, unrelated to its physical position.