Curvature and geometry of tessellating plane graphs

40Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that the growth of plane tessellations and their edge graphs may be controlled from below by upper bounds for the combinatorial curvature. Under the assumption that every geodesic path may be extended to infinity we provide explicit estimates of the growth rate and isoperimetric constant of distance balls in negatively curved tessellations. We show that the assumption about geodesies holds for all tessellations with at least p faces meeting in each vertex and at least q edges bounding each face, where (p, q) ∈ {(3, 6), (4, 4), (6, 3)}.

Cite

CITATION STYLE

APA

Baues, O., & Peyerimhoff, N. (2001). Curvature and geometry of tessellating plane graphs. Discrete and Computational Geometry, 25(1), 141–159. https://doi.org/10.1007/s004540010076

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free