Manhattan orbifolds

Topology and its Applications

Volumn 157, Issue 2, 2010, Pages 494-507

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

2 Manifold; Hyperconvex; Injective metric space; Manhattan distance; Median complex; Orbifold; Squaregraph; Tight span

Indexed keywords

EID: 70350570513     PISSN: 01668641     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.topol.2009.10.008     Document Type: Article

References (19)

1. Aronszajn N., and Panitchpakdi P. Extensions of uniformly continuous transformations and hyperconvex metric spaces. Pacific J. Math. 6 (1956) 405-439
2. Hans-Jürgen Bandelt, Victor Chepoi, Metric graph theory and geometry: A survey, manuscript, 2005
3. Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein, Combinatorics and geometry of finite and infinite squaregraphs, submitted for publication, arXiv:0905.4537, 2009
4. Bein W., Chrobak M., and Larmore L.L. The 3-server problem in the plane. Theoret. Comput. Sci. 287 (2002) 387-391
5. Chepoi V., Dragan F., and Vaxès Y. Center and diameter problems in plane triangulations and quadrangulations. Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2002), ACM/SIAM 346-355
6. Chrobak M., and Larmore L.L. Generosity helps, or an 11-competitive algorithm for three servers. J. Algorithms 16 (1994) 234-263
7. Dress A.W.M., Huber K.T., and Moulton V. Metric spaces in pure and applied mathematics. Doc. Math. (2001) 121-139 Special issue, Proceedings Quadratic Forms LSU
8. Eppstein D. Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. ACM Trans. Algorithms 5 (2009) Article 29
9. Eppstein D., and Goodrich M.T. Succinct greedy graph drawing in the hyperbolic plane. Proc. 16th Int. Symp. Graph Drawing, Heraklion. Crete, 2008. Lecture Notes in Comput. Sci. vol. 5417 (2009), Springer-Verlag 14-25
10. Goodman O., and Moulton V. On the tight span of an antipodal graph. Discrete Math. 218 1-3 (2000) 73-96
11. Isbell J.R. Six theorems about injective metric spaces. Comment. Math. Helv. 39 (1964) 65-76
12. Kleinberg R. Geographic routing using hyperbolic space. Proc. 26th IEEE Int. Conf. Computer Communications. INFOCOM 2007 (2007), IEEE Press 1902-1909
13. Ko{combining double acute accent}nig D. Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe (1936), Akad. Verlag
14. Krauthgamer R., and Lee J.R. Algorithms on negatively curved spaces. Proc. 47th IEEE Symp. Foundations of Computer Science (2006), IEEE Computer Society
15. Larmore L.L., and Oravec J.A. T-theory applications to online algorithms for the server problem. Electronic preprint (2006). arXiv:cs/0611088 [cs.DS]
16. Mai J.-H., and Tang Y. An injective metrization for collapsible polyhedra. Proc. Amer. Math. Soc. 88 (1983) 333-337
17. Papadimitriou C.H., and Ratajczak D. On a conjecture related to geometric routing. Theoret. Comput. Sci. 344 1 (2005) 3-14. ISSN 0304-3975 doi:http://dx.doi.org/10.1016/j.tcs.2005.06.022
18. van de Vel M. Theory of Convex Structures (1993), Elsevier
19. van de Vel M. Collapsible polyhedra and median spaces. Proc. Amer. Math. Soc. 126 (1998) 2811-2818