arXiv · gr-qc/0412094
A discrete curvature on a planar graph
Abstract
Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. Lorente. 2004-12-20. A discrete curvature on a planar graph. https://arxiv.org/abs/gr-qc/0412094
Cite the original work for its findings. Save a collection to share your selection of sources.