TL;DR
This paper extends Pick's theorem, a classic formula for calculating the area of lattice polygons, to a more general class of "H-polygons" defined on a hexagonal tiling of the plane. The authors introduce new parameters, the "boundary characteristic" and "edge characteristic," to account for the complexities of these generalized polygons, ultimately providing a formula for their area.
What Problem Does This Paper Address?
Pick's theorem, a fundamental result in discrete geometry, provides a simple formula for the area of a polygon whose vertices lie on a lattice. Specifically, it relates the area to the number of lattice points on the polygon's boundary and in its interior. However, this theorem is restricted to "simple" polygons (no self-intersections) and specific lattice structures. The authors aim to generalize this theorem to "H-polygons" which are defined on a hexagonal tiling of the plane. These H-polygons are more complex, allowing for self-intersections, overlapping sides, and the ability to "wrap around" areas multiple times. The challenge is to find an analogous formula for the area of these generalized polygons that accounts for their richer structure.
Methods
The paper builds upon existing work on generalized polygons and introduces new concepts to handle the hexagonal tiling.
- H-polygons: Defined as oriented closed curves formed by sequences of "primitive segments" (line segments connecting vertices of the hexagonal tiling with no other tiling vertices in their interior). These polygons can be non-simple.
- Boundary Characteristic (c(P)): For an H-polygon P, this is defined by summing a local characteristic at each vertex on the boundary. The local characteristic at a vertex counts how many tiling edges extend to the "right" of the polygon versus to the "left."
- Edge Characteristic (u(P)): This new parameter is introduced to account for how primitive segments of the polygon interact with the hexagonal tiling. It is defined for "isotropic" primitive segments (those where the tiling edges at both ends point in the same three directions) and involves counting "main" and "non-main" tiling edges that intersect the segment.
- Side Characteristic (s(P)): Defined as the sum of the boundary characteristic and the edge characteristic: $s(P) = c(P) + u(P)$.
- Winding Number (ω(x, R, P)): The paper extends the concept of winding number, which measures how many times a curve winds around a point or region. This is crucial for defining the area of generalized polygons.
- Area Formula for Simple H-polygons: The authors first derive a formula for simple H-polygons: $A(P) = n(P)/4 + s(P)/12 - 1$, where $n(P)$ is the "Pick number" (sum of boundary and twice the interior points of the hexagonal lattice).
- Area Formula for General H-polygons: The main result is a generalized formula for any H-polygon: $A(P) = s(P)/12 + \sum_{x \in H} \omega(x, R, P)/2$. This formula relates the area to the side characteristic and a sum of winding indices over all vertices of the hexagonal tiling.
Datasets
Not discussed in the paper. The paper deals with theoretical geometric objects rather than empirical data.
Key Insights and Ideas
- Generalizing Pick's Theorem is Non-Trivial: The hexagonal lattice and the allowance of non-simple polygons introduce complexities that require new geometric invariants beyond just counting lattice points.
- The Importance of Edge Interactions: The "edge characteristic" ($u(P)$) is a novel and crucial parameter that captures how the polygon's sides align with or cross the underlying hexagonal tiling. This is a key departure from standard lattice point counting.
- Decomposition into Simpler Components: The proof strategy often involves breaking down complex polygons into simpler ones (like primitive triangles or parallelograms) for which area formulas can be derived, and then using these to build up the general result.
- Winding Numbers as a Universal Tool: The generalized winding number definition is essential for defining the area of non-simple polygons, where the concept of "interior" becomes ambiguous.
- Elegant Formulas Emerge: Despite the complexity, the paper arrives at surprisingly elegant formulas that connect geometric properties (boundary characteristic, edge characteristic, winding numbers) to the area.
Key Results
- Theorem 1: The area of a simple H-polygon is given by $A(P) = n(P)/4 + s(P)/12 - 1$.
- Theorem 2: The area of any H-polygon (simple or not) is given by $A(P) = s(P)/12 + \sum_{x \in H} \omega(x, R, P)/2$. This is the main contribution, extending Pick's theorem to generalized H-polygons.
- Mensurability Condition: A simple H-polygon is "mensurable" (its area can be calculated using a specific formula) if and only if its edge characteristic $u(P) = 0$.
Limitations and Future Work
- Computational Complexity: While formulas are provided, the direct computation of parameters like the boundary and edge characteristics for complex H-polygons might be computationally intensive.
- Other Tilings: The authors speculate that similar elegant formulas might exist for generalized polygons on other Archimedean tilings. This suggests a broad avenue for future research.
- Practical Applications: The paper is primarily theoretical. Exploring practical applications of these generalized area formulas in fields like computer graphics, crystallography, or discrete modeling could be a future direction.
Summary updated