2012
DOI: 10.4171/em/188
|View full text |Cite
|
Sign up to set email alerts
|

A discrete Gauss-Bonnet type theorem

Abstract: Oliver Knill hat an der ETH Zürich in Mathematik promoviert. Seit zehn Jahren wirkt er an der Harvard Universität im Preceptor Team, das dort für das Calculus Programm verantwortlich ist.In memory of Ernst Specker.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 25 publications
0
10
0
Order By: Relevance
“…the graph obtained by adding extra edges until all non-triangular faces have been decomposed into triangles. A recent discrete Gauss-Bonnet theorem by Knill [18] says that this curvature integrates to a multiple of the Euler characteristic of the bond graph (see also Theorem 2.1 below, which extends this result to irregular boundaries as needed here). This leads to the following exact expression for the energy (1.1), (1.3) of an arbitrary configuration X = (x 1 , .., x N ) (see Theorem 3.1 below):…”
Section: Introductionmentioning
confidence: 94%
See 3 more Smart Citations
“…the graph obtained by adding extra edges until all non-triangular faces have been decomposed into triangles. A recent discrete Gauss-Bonnet theorem by Knill [18] says that this curvature integrates to a multiple of the Euler characteristic of the bond graph (see also Theorem 2.1 below, which extends this result to irregular boundaries as needed here). This leads to the following exact expression for the energy (1.1), (1.3) of an arbitrary configuration X = (x 1 , .., x N ) (see Theorem 3.1 below):…”
Section: Introductionmentioning
confidence: 94%
“…What turns out to work is a discrete version of Puiseux curvature, applied not to the bond graph but the triangulated bond graph. Discrete Puiseux curvature was recently introduced and studied in the context of subdomains of the triangular lattice by Knill [18], and can be thought of as a boundary-corrected version of Euler curvature, corrected in such a way that flat boundaries have curvature zero. First we define the triangulated bond graph.…”
Section: 4mentioning
confidence: 99%
See 2 more Smart Citations
“…is called the discrete curvature on the graph G (Knill 2012). The definition of discrete curvature is relevant for planar graphs only.…”
Section: Gastrulation: Discrete Curvaturementioning
confidence: 99%