Abstract
Let G be a graph embedded in the L_1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio L_1^G(p,q)/L_1(p,q), where L_1^G(p,q) is the L_1-distance in G between p and q. We show how to compute the stretch factor of an n-vertex path in O(n*(log n)^2) worst-case time and O(n) space and we mention generalizations to trees and cycles, to general weighted fixed orientation metrics, and to higher dimensions.
Original language | English |
---|---|
Title of host publication | Proceedings of the 20th Annual Canadian Conference on Computational Geometry - CCCG 2008 : August 13-15, McGill University, Montréal, Québec, Canada |
Number of pages | 4 |
Publisher | CCCG - Canadian Conference on Computational Geometry, Ottawa, Ontario, Canada |
Publication date | 2008 |
Pages | 59-62 |
Publication status | Published - 2008 |
Event | Canadian Conference on Computational Geometry - Montreal, Canada Duration: 13 Aug 2008 → 15 Aug 2008 Conference number: 20 |
Conference
Conference | Canadian Conference on Computational Geometry |
---|---|
Number | 20 |
Country/Territory | Canada |
City | Montreal |
Period | 13/08/2008 → 15/08/2008 |