Abstract
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.
| Original language | English (US) |
|---|---|
| State | Published - 2006 |
| Externally published | Yes |
| Event | 18th Annual Canadian Conference on Computational Geometry, CCCG 2006 - Kingston, Canada Duration: Aug 14 2006 → Aug 16 2006 |
Conference
| Conference | 18th Annual Canadian Conference on Computational Geometry, CCCG 2006 |
|---|---|
| Country/Territory | Canada |
| City | Kingston |
| Period | 8/14/06 → 8/16/06 |
All Science Journal Classification (ASJC) codes
- Geometry and Topology
- Computational Mathematics