Related papers: A discrete curvature on a planar graph
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
For the minimal graph with strict convex level sets, we find an auxiliary function to study the Gaussian curvature of the level sets. We prove that this curvature function is a concave function with respect to the height of the minimal…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
Weighted Gaussian Curvature is an important measurement for images. However, its conventional computation scheme has low performance, low accuracy and requires that the input image must be second order differentiable. To tackle these three…
We study Gauss curvature for random Riemannian metrics on a compact surface, lying in a fixed conformal class; our questions are motivated by comparison geometry. Next, analogous questions are considered for the scalar curvature in…
A `discrete differential manifold' we call a countable set together with an algebraic differential calculus on it. This structure has already been explored in previous work and provides us with a convenient framework for the formulation of…
Flat sheets encoded with patterns of contraction/elongation morph into curved surfaces. If the surfaces bear Gauss curvature, the resulting actuation can be strong and powerful. We deploy the Gauss-Bonnet theorem to deduce the Gauss…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
We compute the geodesic curvature of logarithmic spirals on surfaces of constant Gaussian curvature. In addition, we show that the asymptotic behavior of the geodesic curvature is independent of the curvature of the ambient surface. We also…
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
In this article, we shall derive by elementary calculations the Gauss map, spherical image, Weingarten map and the curvatures at identity of the special linear group, that is, the matrices of determinant 1. We could not find any reference…
For a large class of self-similar sets F in R^d analogues of the higher order mean curvatures of differentiable submanifolds are introduced, in particular, the fractal Gauss-type curvature. They are shown to be the densities of associated…
Finding appropriate notions of discrete holomorphic maps and, more generally, conformal immersions of discrete Riemann surfaces into 3-space is an important problem of discrete differential geometry and computer visualization. We propose an…
The problem of defining correctly geometric objects such as the curvature is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs.…
A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
In this paper we study the Gauss map of hypersurfaces with constant weighted mean curvature in the Gaussian space. We show that if the image of the Gauss map is in a closed hemisphere, then the hypersurface is a hyperplane or a generalized…
The thickness $\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and…