The discrete Laplace‐Beltrami operator for surface meshes is a fundamental building block for many (if not most) geometry processing algorithms. While Laplacians on triangle meshes have been researched intensively, yielding the cotangent discretization as the de‐facto standard, the case of general polygon meshes has received much less attention. We present a discretization of the Laplace operator which is consistent with its expression as the composition of divergence and gradient operators, and is applicable to general polygon meshes, including meshes with non‐convex, and even non‐planar, faces. By
 Award ID(s):
 2008021
 NSFPAR ID:
 10225284
 Date Published:
 Journal Name:
 International Mathematics Research Notices
 ISSN:
 10737928
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract virtually inserting a carefully placed point we implicitly refine each polygon into a triangle fan, but then hide the refinement within the matrix assembly. The resulting operator generalizes the cotangent Laplacian, inherits its advantages, and is empirically shown to be on par or even better than the recent polygon Laplacian of Alexa and Wardetzky [AW11] — while being simpler to compute. 
The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$ . This map is known to interact nicely with Poncelet polygons, that is, polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of Schwartz states that if $P$ is a Poncelet polygon, then the image of $P$ under the pentagram map is projectively equivalent to $P$ . In the present paper, we show that in the convex case this property characterizes Poncelet polygons: if a convex polygon is projectively equivalent to its pentagram image, then it is Poncelet. The proof is based on the theory of commuting difference operators, as well as on properties of real elliptic curves and theta functions.more » « less

Abstract. We identify certain combinatorially defined rational functions which, under the shuffle to Schiffmann algebra isomorphism, map to LLT polynomials in any of the distinguished copies in the algebra of symmetric functions embedded in the elliptic Hall algebra of Burban and Schiffmann. As a corollary, we deduce an explicit raising operator formula for the nabla operator applied to any LLT polynomial. In particular, we obtain a formula for ∇msλ which serves as a starting point for our proof of the LoehrWarrington conjecture in a companion paper to this onemore » « less

Distance is an important and basic concept in geography. Many theories, methods, and applications involve distance explicitly or implicitly. While measuring the distance between two locations is a straightforward task, many geographical processes involve areal units, where the distance measurement can be complicated. This research investigates distance measurement between a location (point) and an area (polygon). We find that traditional polygon‐to‐point distance measurements, which involve abstracting a polygon into a central or representative point, could be problematic and may lead to biased estimates in regression analysis. To solve this issue, we propose a new polygon‐to‐point distance metric along with two algorithms to compute the new distance metric. Simulation analysis shows the effectiveness of the new distance metric in providing unbiased estimates in linear regression.

Abstract In this article, we continue the study of a certain family of 2Calabi–Yau tilted algebras, called dimer tree algebras. The terminology comes from the fact that these algebras can also be realized as quotients of dimer algebras on a disk. They are defined by a quiver with potential whose dual graph is a tree, and they are generally of wild representation type. Given such an algebra $B$, we construct a polygon $\mathcal {S}$ with a checkerboard pattern in its interior, which defines a category $\text {Diag}(\mathcal {S})$. The indecomposable objects of $\text {Diag}(\mathcal {S})$ are the 2diagonals in $\mathcal {S}$, and its morphisms are certain pivoting moves between the 2diagonals. We prove that the category $\text {Diag}(\mathcal {S})$ is equivalent to the stable syzygy category of the algebra $B$. This result was conjectured by the authors in an earlier paper, where it was proved in the special case where every chordless cycle is of length three. As a consequence, we conclude that the number of indecomposable syzygies is finite, and moreover the syzygy category is equivalent to the 2cluster category of type $\mathbb {A}$. In addition, we obtain an explicit description of the projective resolutions, which are periodic. Finally, the number of vertices of the polygon $\mathcal {S}$ is a derived invariant and a singular invariant for dimer tree algebras, which can be easily computed form the quiver.