Abstract
We study planar polygonal curves with the variational methods. We show a unified interpretation of discrete curvatures and the Steiner-type formula by extracting the notion of the discrete curvature vector from the first variation of the length functional. Moreover, we determine the equilibrium curves for the length functional under the area-constraint condition and study their stability.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Discrete differential geometry is an active research field with connections to the smooth manifold theory and visualization on the computer. In this field, from the theoretical point of view, one approach is based on the variational problems and the other on integrability of equations. We take the former approach and focus on discrete planar curves. Surprisingly, such a discrete curve theory is not well understood, therefore we further develop it inspired by the work [10]. Moreover, we consider the stability problem for equilibrium discrete curves. The stability problem for discrete objects has not developed well after the work by Polthier and Rossman [11].
First we derive the first variation formula and extract a vector from the formula, called the discrete curvature vector in Sect. 2. In Sect. 3, by using this curvature vector, we show a unified interpretation which derives various kinds of discrete curvature notions introduced in [7, 8]. The important viewpoint here is that there is no natural notion of the line element on the vertices. In Sect. 4, we characterize equilibrium curves for the length functional under the area-constraint condition as regular polygons. In Sect. 5, we derive a Steiner-type formula for parallel curves by using the “vertex normal” constructed from the discrete curvature vector derived in Sect. 2. In Sect. 6, we consider the stability problem of the regular polygons. We can derive the second variation formula, similar to the smooth case, by decomposing the variation vector field into the “normal” and “tangential” directions as in [1]. Moreover, we show the instability for the non-convex regular polygons by using the second variation formula for “normal” variations in Sect. 7.
2 The First Variation Formula
In this section we will consider the variation of discrete curves and extract the “curvature vector” from the first variation formula. We can expect that this vector gives a notion of the curvature and normal at vertices. Let us recall the basic definition of discrete planar curves.
Definition 2.1
Let n be a non-negative integer. A standard (abstract) n-path is a simplicial complex \(G = (V, E)\) formed by
-
\(n+1\) abstract points \(V = \{ v_0, \ldots , v_n \}\),
-
the set of n edges \(e_k = [v_k, v_{k+1}]\), \(k = 0, \ldots , n-1\).
A standard abstract n-circle is the union of a standard n-path and the “final” edge \(e_n = [v_n, v_0]\). A discrete (planar) curve is a geometric realization of a standard \((n-1)\)-path or \((n-1)\)-circle, which is a map \(X:V \rightarrow {\mathbb {R}}^2\) satisfying \(l_k := |p_{k+1} - p_k| \ne 0\) for all \(k = 0,1,\ldots ,n-1\), where we denote \(p_k := X(v_k)\). We denote such a discrete curve as \(\Gamma _h = \{ p_k \}_k\).
To each oriented edge \(e_k := [p_k, p_{k+1}]\) of \(\Gamma _h\) we can assign a unit normal vector
where R is the \((\pi /2)\)-rotation or \((-\pi /2)\)-rotation in \({\mathbb {R}}^2\). It does not matter which one we choose, but we choose the same R for all k. For a discrete curve \(\Gamma _h = \{ p_k \}_k\) with an orientation, the length of \(\Gamma _h\) and the 2-dimensional volume (area) bounded by \(\Gamma _h\) are defined by
In these settings, we consider the following question:
A realization of the dual graph may give an answer for this question, but we do not consider such a realization. In order to approach the problem, we will extract the discrete curvature vector from the first variation of the length. Therefore we first derive the first variation formula of the length functional. In the discrete setting we consider the variation of vertices, that is, piecewise linear variations. We consider a variation
where \({}^t \vec {v} = ({}^t v_0, \ldots , {}^t v_{n-1}) \in {\mathbb {R}}^{2n}\) is the “variation vector field”. If \(p_k\) is a boundary point of \(\Gamma _h\), then we assume \(v_k =0\).
We want to find the vector \({}^t \nabla L \in {\mathbb {R}}^{2n}\) satisfying
where we write \({}^t \nabla L = ({}^t \nabla _{\!p_1} L, \ldots , {}^t \nabla _{\!p_n} L) \in {\mathbb {R}}^{2n}\). Since this is just a directional derivative in \({\mathbb {R}}^{2n}\), the following proposition is immediate:
Proposition 2.2
Let \(\Gamma _h = \{ p_k \}_k\) be a discrete closed curve and \(p_k\) an interior vertex. Then the gradient of the length can be expressed as in the following formula:
By using this formula we have
where we inserted some auxiliary function \(L_k\) defined on the vertices. This kind of observation is essentially remarked on in the paper [3].
Definition 2.3
(discrete curvature vector) For a positive function \(L_k\) defined on the vertices, we call the vector
the discrete curvature vector with respect to \(L_k\).
Remark 2.4
There are some reasons why we can regard the vector \(\widetilde{N}_k\) as the curvature vector. First, the vector \(\widetilde{N}_k\) is independent of the choice of the unit normal, i.e., an intrinsic quantity. Moreover, the second expression (2.2) can be regarded as a discretization of a part of the Frenet–Serret formula. As we will remark below, suitable choices of the function \(L_k\) derive various notions of discrete curvature defined in [7, 8]. Non-uniqueness of the function \(L_k\) comes from the fact that there is no natural line element, i.e., the metric, at vertices.
3 Relation with Other Notions of the Discrete Curvature
In this section, non-uniqueness of the line element at the vertices gives various notions of the discrete curvature defined in [7, 8].
To describe the curvature notions, we have to define the angles at vertices. We define (the absolute value of) the angle between \(\nu _{k-1}\) and \(\nu _k\) as \(\theta _k\), i.e.,
We have to care about the signature of \(\theta _k\). Let \(R_\theta \) be the \(\theta \)-rotation in \({\mathbb {R}}^2\). We assign the signature depending on the choice of the rotation R appearing in the definition of the edge normal:
In this situation the signature of \(\theta _k\) is determined by the equation \(R_{\sigma \theta _k}(\nu _{k-1})=\nu _k\). We easily see that \(\sum _k\theta _k=2m\pi \) for some integer \(m\in {\mathbb {Z}}\) for any closed curve. We define the discrete curvature with respect to the choice of \(L_k\) by the length of the discrete curvature vector with respect to \(L_k\):
Definition 3.1
For a positive function \(L_k\) defined on the vertices, we call the value
the discrete curvature with respect to \(L_k\).
Remark 3.2
If we use the expression \(\nabla _{\!p_k} L = R(\nu _k - \nu _{k-1})\), the discrete curvature with respect to \(L_k\) can be written as \(\kappa (p_k) = |\nu _k - \nu _{k-1}|/L_k\) up to the signature. This can be regarded as a discretization of the curvature for a regular planar curve.
In the lecture notes by Tim Hoffmann [8], three kinds of notions of the curvature for discrete curves are introduced:
-
the curvature at vertices by using the vertex osculating circle method,
-
the curvature at edges by using the edge osculating circle method, and
-
the curvature at vertices by using edge osculating circle for “arclength parametrized” curve.
Moreover, Hatakeyama [7] also defined the curvature for discrete curves another way. We will show that these curvature notions can be derived from our viewpoint.
Proposition 3.3
(vertex osculating circle method [8]) If we choose
then the discrete curvature with respect to \(L_k\) becomes
and this value coincides with the curvature based on the vertex osculating circle method.
Proposition 3.4
(for the arclength parametrized curves [8]) Assume \(l_k = l_{k-1} = l_0\). If we choose
then the discrete curvature with respect to \(L_k\) becomes
and this value coincides with the curvature of arclength parametrized curve.
In the paper [7], the discrete curvature at a vertex is defined as
Then we immediately have the following result:
Proposition 3.5
If we choose \(L_k = l_{k-1} = |p_k - p_{k-1}|\), then the discrete curvature with respect to \(L_k\) coincides with the discrete curvature defined in [7].
Before considering the edge osculating circle method, we shall modify the first variation formula from the vertex-based expression to the edge-based expression. If we put \(v_k = (w_k + w_{k-1})/2\), then we have
where \(L_k'\) is some auxiliary function. As in the vertex case, we call the value
the discrete curvature at the edge \(e_k = [p_k, p_{k+1}]\) with respect to \(L_k'\).
Proposition 3.6
(edge osculating circle method [8]) If we choose
then the discrete curvature with respect to \(L_k'\) becomes
and this value coincides with the curvature based on the edge osculating circle method.
Remark 3.7
To define the discrete curvature, we have to choose \(L_k\) (respectively \(L_k'\)) properly. That means if \(l_k,l_{k-1} \rightarrow ds\) and \(\theta _k \rightarrow 0\), then \(L_k\) (respectively \(L_k'\)) must converge to ds, i.e., \(L_k\) must be a “good” candidate for a discrete line element. We can check that \(L_k\) and \(L_k'\) satisfy this condition in the above examples.
Remark 3.8
(relations with the discrete Laplacian) On a discrete curve \(\Gamma _h\) with the vertex set V, we consider a function \(\psi :V \rightarrow {\mathbb {R}}\). Then the gradient and the Laplacian of \(\psi \) can be defined as
where we denote \(\psi _k := \psi (k)\). Since the Laplacian should be a linear operator and determined by a local property, this definition can be seen as a special case of the discrete Laplacian from [12]. Note that the gradient is an “edge-based operator” but the Laplacian is a “vertex-based” operator. In addition, the discrete curvature vector \(\widetilde{N}_k\) with respect to \(L_k\) can be written as \(\Delta p_k\).
From another point of view, if we define the Dirichlet energy of \(\psi \) as
then the first variation of the energy becomes
where we take the variation of \(\psi \) as \(\psi _k (t) = \psi _k + t \varphi _k + O(t^2)\). Therefore \(\delta E_h (\psi ) = 0\) if and only if \(\Delta \psi _k=0\). Note that the condition \(\Delta \psi _k = 0\) is independent of the choice of \(L_k\).
As in the curvature case, the Laplacian can be changed since there is no natural “line element divisor \(L_k\)”. However, with another function \(\varphi :V \rightarrow {\mathbb {R}}\), we still have the following properties, since the quantities \(\Delta \psi _k L_k\) are independent of \(L_k\):
-
If \(\psi \) is constant, then \(\Delta \psi = 0\).
-
The condition \(\Delta \psi = 0\) is independent of the choice of \(L_k\) and in this case we have the mean value property:
$$\begin{aligned} \psi _k = \dfrac{l_{k-1}}{l_k + l_{k-1}} \psi _{k+1} + \dfrac{l_k}{l_k + l_{k-1}}\psi _{k-1}. \end{aligned}$$ -
\(L^2\) symmetric property:
$$\begin{aligned} \sum _k \psi _k \cdot \Delta \varphi _k \cdot L_k = \sum _k \Delta \psi _k \cdot \varphi _k \cdot L_k. \end{aligned}$$Note that the summation is vertex-based.
-
Integration by parts:
$$\begin{aligned} - \sum _k \psi _k \cdot \Delta \varphi _k \cdot L_k = \sum _k \nabla \psi _k \cdot \nabla \varphi _k \cdot l_k. \end{aligned}$$Note that the right hand side is an edge-based summation but the left hand side is a vertex-based summation. As a corollary, the operator \(-\Delta \) is positive semi-definite.
4 Equilibrium Curves of the Length Functional
In the previous section, we showed that non-uniqueness of the line element at vertices gives various discrete curvature notions. However, the equilibrium curves for the length functional under the area-constraint condition should be characterized as some “constant curvature” objects by virtue of the smooth case. In this section, we show that such equilibrium curves can be characterized as regular polygons and that they certainly can be regarded as “constant curvature” objects. By a direct calculation we have the following result.
Lemma 4.1
For any vertex \(p_k\) of \(\Gamma _h\) the gradient of the area, \(\nabla _{\!p_k}{{{\,\mathrm{Area}\,}}}\), is given by
Remark 4.2
We can modify the first variation formula of the volume as follows:
It is natural to choose \(2L_k = l_k + l_{k-1} = {{\,\mathrm{Length}\,}}(\star (p))\) and this is also frequently used as a “vertex normal” (a weighted sum of the edge normals):
In addition, we have
by a simple calculation. Therefore, unless the curve is arclength parameterized, there are (at least) two choices of the “vertex normal” from the variational viewpoint: using the length gradient (length descent direction) or using the volume gradient (volume descent direction). This suggests that, in contrast to the smooth case, we have to choose the “preferred” vertex normal according to the energy in question.
Example 4.3
(regular polygons) Let us take a discrete curve \(\Gamma _h^{m,n} = \{ p_k \}_k\) as follows (inducing non-convex regular n-gon with radius a):
where we assume that \(m/n \ne 1/2\). In particular, we sometimes call the curve \(\Gamma _h^{1,n}\) a convex regular n-gon. Note that \(\Gamma _h^{n-1,n}\) is also convex but it has an opposite unit normal with \(\Gamma _h^{1,n}\) (usually we assume that \(\Gamma _h^{1,n}\) has the outward-pointing unit normal). Then the curve \(\Gamma _h^{m,n}\) is a critical point of the functional \({{{\,\mathrm{Length}\,}}} + \kappa \cdot {{{\,\mathrm{Area}\,}}}\) with \(\kappa = - 1/ (a \cos (m \pi /n))\). This value is the reciprocal of the radius of the inscribed circle of the polygon (up to the signature). We sometimes say that a convex regular n-gon with radius a (and outward-pointing unit normal) has constant curvature \(\kappa _n = -1/(a \cos (\pi /n))\). Note that \(\cos (\pi m/n)=-\cos (\pi (n-m)/n)\) and \(\kappa _n \rightarrow -1/a\) when \(n \rightarrow \infty \).
We will show that these regular polygons are the only equilibrium curves for the functional \(L + \kappa \cdot {{{\,\mathrm{Area}\,}}}\).
Theorem 4.4
Let \(\Gamma _h = \{ p_k \}_{k=1}^n\) be a closed discrete curve and take \(\kappa \in {\mathbb {R}}\setminus \{ 0 \}\). Then the following two conditions are equivalent:
-
\(\Gamma _h\) is an equilibrium curve of the functional \(L + \kappa \cdot { {{\,\mathrm{Area}\,}}}\).
-
There exist numbers \(l_0\) and \(\theta _0\) such that \(l_k \equiv l_0\), \(\theta _k \equiv \theta _0\), and \(\kappa l_0 = 2 \tan (\theta _0/2)\), i.e., \(\Gamma _h\) must be a regular polygon.
Proof
We put
Then the discrete curve \(\Gamma _h\) is a critical point of the functional \({{{\,\mathrm{Length}\,}}} + \kappa \cdot {{{\,\mathrm{Area}\,}}}\) if and only if \(A_k = 0\) for all k. By a simple calculation we have
For the necessity, that is, if we assume \(A_k = 0\) for all k, then it follows from (4.1) and (4.2) that \(\kappa l_k=2 \tan (\theta _k /2) = \kappa l_{k-1}\). And it also follows from (4.2), (4.3), and using \(l_k = l_{k-1}\) that
To prove the sufficiency, since \(\nu _k\) and \(p_k - p_{k-1}\) form a basis of \({\mathbb {R}}^2\) and \(\langle A_k, \nu _k \rangle = 0\) by (4.1) and the assumption, all we have to prove is \(\langle A_k, p_k - p_{k-1} \rangle = 0\) for all k. By using the assumption \(l_k = l_{k-1} = l_0\) and \(\theta _k = \theta _0\), we have
This shows \(A_k=0\) and proves the statement. \(\square \)
Remark 4.5
The equilibrium condition \(A_k = \nu _k - \nu _{k-1} + (\kappa /2)(p_{k+1}-p_{k-1})=0\) is equivalent to the condition \(\nu _k + (\kappa /2) (p_{k+1} + p_k) \equiv c\) for some constant vector \(c\in {\mathbb {R}}^2\). The latter condition can be considered as a conservation law for the Euler–Lagrange equation \(A_k=0\). Since the vector \(c\in {\mathbb {R}}^2\) is just a translation of the curve, we can put \(c=0\) and in this case we have \((p_{k+1}+p_k)/2=-\nu _k/\kappa \). Therefore, the edge midpoints must be tangent to the unit circle.
We found that equilibrium closed curves of the functional \(L + \kappa \cdot {{{\,\mathrm{Area}\,}}}\) must satisfy \(l_k \equiv l_0\), i.e., they must have “good coordinates (arclength parameter)”. If we note that we can define the curvature at vertices for an arclength parametrized curve, the previous result can be restated as follows:
Corollary 4.6
Let \(\Gamma _h\) be an arclength parametrized discrete closed curve, i.e., \(l_k \equiv l_0\), and \(\kappa \in {\mathbb {R}}\setminus \{ 0 \}\). Then the following two conditions are equivalent:
-
\(\Gamma _h\) is an equilibrium curve of the functional \({{{\,\mathrm{Length}\,}}} + \kappa \cdot {{{\,\mathrm{Area}\,}}}\).
-
The discrete curvature \((2/l_0) \tan (\theta _k /2)\) is constant and \(=\kappa \).
5 Parallel Curves and Steiner-Type Formula
In this section we will derive the discrete version of the Steiner-type formula in order to show effectiveness of the vertex normal we will define. The following type of Steiner formula has in fact appeared in some papers, e.g., [2, 4]. There, however, the notion of curvature is tried to be found with the Steiner-type formula; here we will derive the Steiner-type formula by using our vertex normal and connect it with the well-known notion of curvature.
Let \(\Gamma _h = \{ p_k \}_k\) be a discrete curve and take an interior vertex \(p_k\). We can expect that if we normalize the discrete curvature vector, then we have the “vertex normal”. Recall that the length of the length gradient \(\nabla _{\!p_k} L\) can be computed as \(2\sin (\theta _k/2)\) up to the signature. In the discrete case, we should consider another factor \(2\sin (\theta _k/2)\cos (\theta _k/2)=\sin \theta _k\) and put
Then we shall call the vector \(N_k\) the vertex normal at \(p_k\). The second expression in (5.1) allows us to define the vertex normal even if \(\theta _k=0\). Then we consider the following deformation of the curve:
Lemma 5.1
We have \(\langle p_{k+1}(t) - p_k(t), \nu _k \rangle = 0\); therefore we call this deformation parallel curves.
Proof
This is a direct calculation:
\(\square \)
Theorem 5.2
(discrete Steiner-type formula) For parallel curves \(\{ p_k(t) \}_k\), we have
where \(\kappa (e_k)\) is the discrete curvature based on the edge osculating circle method [8]:
Before giving the proof, we give an intuitive explanation for a special case. In Fig. 2, the similarity ratio of the triangles gives
Note that the signature of the curvature radius \(r_k\) is negative in the figure.
Proof
By direct calculation we have
Therefore we conclude
\(\square \)
Remark 5.3
This formula itself has already appeared in some papers aiming to find the discrete curvature at the vertices by using the offsets, see [2, 4]. If we take the offset of the edges, then we have the following (at least) three possibilities. By computing the length of dotted curves in the figure, we can write the total length of each offset as follows:
Note the signature of the angles. The second curve \(\Gamma _h^{(2)}\) is nothing but the normal cone method (or the boundary of the Minkowski sum with the disk) known in convex geometry. However, the only possible way to keep the number of the vertices unchanged during the offset procedure is the third one, and modifying the third formula gives our Steiner-type formula:
where we put \(\kappa (e_k) = (\tan (\theta _k / 2) + \tan (\theta _{k+1} /2)) / l_k\).
Remark 5.4
(discrete Frenet–Serret formula) In Sect. 2, we remarked that the relation
can be considered as a part of the Frenet–Serret formula. On the other hand, by some calculation we have
This formula can be seen as the other part of the Frenet–Serret formula. Note that the former formula is a formula on the vertex \(p_k\) while the latter formula is a formula on the edge \([p_k, p_{k+1}]\).
6 The Second Variation Formula
In this section we consider the second variation formula of the length functional. We will follow the argument developed in [11].
Let \(\Gamma _h = \{ p_k \}_k\) be an equilibrium closed curve for the functional \(L + \kappa \cdot { {{\,\mathrm{Area}\,}}}\). We say a variation is admissible (or permissible) if the variation is volume-preserving and fixes the boundary. We recall the first variation formula of the length and the 2-dimensional volume:
Note that if the variation is admissible, then we have
Lemma 6.1
Let \(\Gamma _h = \{ p_k \}_k\) be an equilibrium closed curve for \(L + \kappa \cdot {{{\,\mathrm{Area}\,}}}\) and \(p_k(t) = p_k + t v_k + O(t^2)\) be an admissible variation. Then we have
Definition 6.2
(stability of discrete curves) Let \(\Gamma _h = \{ p_k \}_k\) be a closed equilibrium curve for the functional \(L + \kappa \cdot {{{\,\mathrm{Area}\,}}}\). Then \(\Gamma _h\) is said to be stable if \(\delta ^2 L \ge 0\) for any admissible variation.
We introduce the matrices \(Q^L\) and \(Q^A\) as follows:
Then we can write \(\delta ^2 L = {}^t \vec {v}(Q^L + \kappa Q^A)\vec {v}\).
Lemma 6.3
\({}^t \vec {v}Q^A \vec {v} = \sum _k \langle v_k, R v_{k+1} \rangle \).
Proof
The proof follows from direct computation:
\(\square \)
Proposition 6.4
(second variation formula for the length functional)
and therefore we have the following second variation formula for the length functional:
Proof
By using the fact that \(l_k \delta \nu _k = R(v_{k+1} - v_k) - \langle R(v_{k+1} - v_k), \nu _k \rangle \nu _k\), we have
\(\square \)
In the section on the Steiner-type formula, we used the vector
as the “normal vector” at the vertex \(p_k\). If we define the “tangent vector” \(T_k\) as \(T_k = -RN_k\), then we can decompose the variation vector \(v_k\) as
where \(\psi , \eta :V \rightarrow {\mathbb {R}}\) are some functions on the vertices. If \(\eta _k = 0\) for all k, we call the variation the normal variation. In the following we will use this notation.
Lemma 6.5
The first variation formula of the volume can be written as
In particular, if the curve \(\Gamma _h = \{ p_k \}_k\) satisfies \(l_k \equiv l_0\), then a variation \(p_k(t) = p_k + t (\psi _k N_k + \eta _k T_k) + O(t^2)\) is volume-preserving if \(\sum _k \psi _k = 0\).
Proof
Using the first variation formula, we have
\(\square \)
Remark 6.6
For functions \(\psi _k\) satisfying \(\sum _k \psi _k = 0\), we can find variations whose variation vector fields are \(\psi _kN_k\). The proof is completely the same as in [1].
Recall that if \(\{p_k\}_k\) is an equilibrium curve of the functional \(L+\kappa \cdot {{{\,\mathrm{Area}\,}}}\), then we have \(l_k\equiv l_0\), \(\theta _k\equiv \theta _0\), and \(\kappa l_0=2 \tan (\theta _0/2)\).
Lemma 6.7
Therefore we have
Proof
Recall that
If we note that \(|N_k| = 1/{\cos (\theta _0/2)}\), then
Similarly, since
we have
Subtracting these factors we have
\(\square \)
Lemma 6.8
Proof
This is also a simple calculation:
\(\square \)
Theorem 6.9
(second variation formula for the length functional)
In particular, for the normal variation we have
where we use the integration by parts and take the line element at the vertex as \(L_k = (l_k + l_{k-1})/2 = l_0\).
Proof
By using the previous lemmas, we have
Summing up, we get the desired result. \(\square \)
7 Instability of Non-Convex Regular Polygons
In this section we will prove that non-convex regular polygons and convex regular polygons with multiplicity are unstable. To prove this, we find a special variation with a help of the following discrete version of Wirtinger’s inequality:
Theorem 7.1
(discrete Wirtinger’s inequality [6]) Let \(\psi _0,\ldots ,\psi _n\) be \(n+1\) real numbers such that
Then we have
and the equality holds if and only if there exist \(A, B \in {\mathbb {R}}\) such that
In the following, we will consider the normal variation, i.e., the variation of the form
where \(\psi _k\) satisfies \(\sum _k \psi _k = 0\). By the second variation formula (Theorem 6.9) we have
for any admissible variations, where we use the relation \(\kappa l_0 = 2 \tan (\theta _0/2)\), put \(\theta _0 = 2 m \pi / n\) for some \(m \in {\mathbb {Z}}\), and assume that \(m/n \ne 1/2\).
Theorem 7.2
(instability of non-convex regular polygons) Let \(n \ge 5\). By taking \(\psi _k\) as in (7.2), \((A, B) \ne (0, 0)\), we have
In particular, \(\delta ^2 {L} < 0\) for \(2 \le m \le n-2\), i.e., non-convex regular polygons are unstable.
Proof
By the discrete Wirtinger’s inequality we have
In the following we use (7.2) and put \(\varphi _k = -A \sin (2 \pi k/n) + B \cos (2\pi k/n)\). Then we have
If we note that \(\sum _k \psi _k \varphi _k = 0\), then
If \(m=1\) or \(m=n-1\), then
On the other hand, for \(2 \le m \le n-2\) and \((A, B) \ne (0, 0)\) we have
where we use the fact \(\tan ^2 (m \pi /n) \ge \tan ^2(2\pi /n)\) if \(2\le m\le n-2\), and \(\cos (2\pi /n)>0\) if \(n\ge 5\). This proves the statement. \(\square \)
8 Concluding Remarks
We observe the second variation formula from the analysis of the Jacobi operator. We can modify the equation (7.1) as follows:
where we put \(\alpha = 1 + 2 \tan ^2 (m\pi /n)\) and
Since H is a circulant matrix, the eigenvalues \(\lambda _j\) can be calculated explicitly, see e.g. [5]:
The corresponding eigenvectors are
The condition \(\sum _k \psi _k = 0\) is equivalent to the condition that \(\Psi = {}^t (\psi _1, \ldots , \psi _n)\) is perpendicular to \(e_n = {}^t (1, \ldots , 1)\). Therefore we only consider the eigenvalues \(\lambda _1, \ldots , \lambda _{n-1}\).
Lemma 8.1
For \(m \le j \le n-m\), \(\lambda _j > 0\). In particular, \(\lambda _j > 0\) for \(1 \le j \le n-1\) if \(m=1\), i.e., the convex regular polygon case.
Proof
This is a direct calculation:
\(\square \)
Theorem 8.2
Assume \(m \ge 2\). For \(1 \le j \le m/2\) or \(n - m/2 \le j \le n-1\), we have \(\lambda _j < 0\). Therefore, the index of a non-convex regular polygon or a convex polygon with multiplicity is at least \(\lfloor m/2 \rfloor \).
Proof
Under the above conditions, we have
\(\square \)
Remark 8.3
More precisely, \(\lambda _j < 0\) for \(j < (n /\pi ) \arctan (\sin (m\pi /n))\).
Remark 8.4
From another point of view, a non-convex regular polygon is the high-frequency component of the discrete Fourier expansion of the polygon. More precisely, any polygon in \({\mathbb {R}}^2\) with n vertices can be regarded as a point in \({\mathbb {R}}^{2n}\simeq {\mathbb {C}}^n\). Each eigenvector \(e_k\) in (8.1) corresponds to the regular n-gon and \(\{e_1,\ldots ,e_n\}\) forms a basis of \({\mathbb {C}}^n\). Therefore, any polygon in \({\mathbb {R}}^2\) can be written as a linear combination of regular n-gons and this fact corresponds to the discrete Fourier expansion.
References
Barbosa, J.L., do Carmo, M.: Stability of hypersurfaces with constant mean curvature. Math. Z. 185(3), 339–353 (1984)
Bauer, U., Polthier, K., Wardetzky, M.: Uniform convergence of discrete curvatures from nets of curvature lines. Discrete Comput. Geom. 43(4), 798–823 (2010)
Chow, B., Glickenstein, D.: Semidiscrete geometric flows of polygons. Am. Math. Mon. 114(4), 316–328 (2007)
Crane, K., Wardetzky, M.: A glimpse into discrete differential geometry. Not. Am. Math. Soc. 64(10), 1153–1159 (2017)
Davis, P.J.: Circulant Matrices. A Wiley-Interscience Publication. Pure and Applied Mathematics. Wiley, New York (1979)
Fan, K., Taussky, O., Todd, J.: Discrete analogs of inequalities of Wirtinger. Monatsh. Math. 59, 73–90 (1955)
Hatakeyama, Y.: Some Attempts to Construct Geometric Theories to Represent and Explicate Physical Phenomena. PhD thesis, Kyushu University (2019)
Hoffmann, T.: Discrete Differential Geometry of Curves and Surfaces. COE Lecture Note, vol. 18. Math-for-Industry (MI) Lecture Note Series. Kyushu University, Faculty of Mathematics, Fukuoka (2009)
Pinkall, U., Polthier, K.: Computing discrete minimal surfaces and their conjugates. Exp. Math. 2(1), 15–36 (1993)
Polthier, K.: Polyhedral Surfaces with Constant Mean Curvature. Habilitation thesis, Technische Universität Berlin (2002)
Polthier, K., Rossman, W.: Discrete constant mean curvature surfaces and their index. J. Reine Angew. Math. 549, 47–77 (2002)
Wardetzky, M., Mathur, S., Kälberer, F., Grinspun, E.: Discrete Laplace operators: no free lunch. In: Eurographics Symposium on Geometry Processing (Barcelona 2007), pp. 33–37. Eurographics Association, Goslar (2007)
Acknowledgements
The author would like to express his gratitude to Professor Miyuki Koiso and Professor Hisashi Naito for invaluable comments and fruitful discussions. This work is partially supported by JST CREST Grant Number JPMJCR1911, Japan.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: János Pach
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Jikumaru, Y. On the Stability Problem of Equilibrium Discrete Planar Curves. Discrete Comput Geom 67, 543–563 (2022). https://doi.org/10.1007/s00454-021-00307-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-021-00307-2