We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work also for non-triangular graphs, and their virtual coordinates are easy to construct.
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler