Counting Parallel Segments: New Variants of Pick’s Area Theorem

provides a polygonal of

ick's area theorem provides a simple and unexpected formula for calculating the area of simple polygons whose vertices lie on lattice points. Consider the standard square lattice Z 2 consisting of points with integer coordinates. A simple lattice polygon P is the region bounded by a simple (i.e., nonintersecting) closed polygonal chain whose vertices belong to Z 2 (in other words, the vertices have integer coordinates). It is convenient for us to consider the boundary of P to be part of the polygon.
Pick's area theorem [12], a famous result in elementary plane geometry, states that the area of a simple lattice polygon P containing B lattice points on its boundary and I lattice points in its interior is given by This formula is so simple, elegant, and unexpected that it is routinely included in various collections of elementary and nonelementary mathematical results [11,2,1]. Generalizations of (1) [13,14,6,10] have led to a number of interesting mathematical results in the fields of algebraic, discrete, and computational geometry [9,7,3,5] (see also references therein). A common approach to proving Pick's area theorem consists in subdividing the polygon P into elementary parts for which (1) can be easily verified. Then an invocation of the additive property of the right-hand side of (1) (formally, I þ B=2 À 1 is a valuation on the set of lattice polygons [5]) proves the theorem.
Formula (1) is not valid for general lattice polygons, those that may have holes or whose boundaries may have self-intersections. Following [13,17,15], we deal with nonsimple lattice polygons. For a nonsimple lattice polygon P we assume that (a) the boundary of P, oP, may consist of several disconnected components; (b) if two edges of oP intersect, the intersection point is a lattice point; (c) every boundary segment separates the interior of P from the exterior of P. Figure 1 presents examples of nonsimple lattice polygons.
For nonsimple lattice polygons, the following extension of (1) was established by Reeve [13]: where vðPÞ and vðoPÞ are the Euler characteristics of P and oP. Figure 1 also presents examples of area calculations using (2). An elegant result like (1) deserves an elegant proof, and one such proof for Pick's area theorem was proposed in [4]. The idea is to assume that at time 0, a unit of heat is concentrated at each lattice point. Then at time 1, heat is uniformly distributed over the whole plane, and a simple analysis shows that the amount of heat contained within polygon P is given by the right-hand side of (1).
In the following, abusing terminology, the term polygon will mean a nonsimple lattice polygon.
Our approach is inspired by the heat conduction proof of [4]. However, instead of units of heat concentrated at the lattice points, we deal with a family of parallel lattice segments (e.g., the vertical lattice segments). A lattice segment is the segment connecting two lattice points belonging to the lattice graph and containing no other lattice points. We assume that each lattice segment situated, possibly without its endpoints, in the interior of P, a whole segment, contains a unit amount of heat.
Then we expect that each boundary segment, a lattice segment belonging to oP, contains half of the unit amount of heat. It remains to estimate the contribution of the remaining incomplete lattice segments situated in the interior of P. We call a lattice segment partial if it crosses oP and its intersection with the interior of P is not empty. Our formula for the area of P includes the numbers of whole, boundary, and partial segments. Namely, let w, b, and p denote the numbers of whole, boundary, and partial segments. We have the following result. THEOREM 1. The area of a lattice polygon via parallel lattice segments is given by the following formula: Our proof of (3) is straightforward. Let us define a function Consider a primitive lattice triangle (a lattice triangle is primitive if its three vertices are its only lattice points). It is well known that the area of every primitive lattice triangle is 1/2 (see, for example, [11,Chapter 2]). For a primitive lattice triangle, (4) yields 1/2 (see the left-hand image of Figure 4, for example). We say that a lattice polygon P is decomposed into two lattice polygons P 1 and P 2 if P ¼ P 1 [ P 2 and the interiors of P 1 and P 2 have empty intersection. Then which means that a(P) is a valuation. This completes the proof of (3). Figure 4 illustrates the proof visually. As demonstrated in Figure 5, like Reeve's formula (2), our formula (3) can be easily extended to nonsquare lattices.
Counting radial segments. One can consider radial segments instead of parallel ones, as seen in Figure 6. Given a lattice polygon, let us consider a lattice point and draw a ray passing through the point and each lattice point of the polygon.
• If the origin of the rays is located outside the polygon, as shown in Figure 6(a), then we count the intersection segments in exactly the same way as when the segments are parallel. • If the origin of the rays is situated in the interior of the polygon, we think of the origin as being excluded from the polygon. So each ray segment belonging to the polygon and connecting the origin to a polygon lattice point and containing no other lattice points is considered a partial segment, which contributes only 1/2 to the area of the polygon. Similarly, each ray segment connecting the origin to a lattice point outside the polygon and containing no other lattice points is excluded from the area computation. See Figure 6(b) for examples. • Finally, if the origin is a boundary vertex of the polygon, we also think of it as being excluded from the polygon, and in addition, we assign only 1/4 to a boundary lattice segment connecting the origin to its neighboring boundary vertex, as demonstrated in Figure 6(c) (alternatively, we could introduce partial boundary segments, each of which contributes 1/4 to the area).
It is easy to see that the proposed way of counting the radial segment contributions satisfies the additive property (so it is a valuation) and gives the area if the polygon is a primitive lattice triangle. Thus it yields the area of a general lattice polygon.  One can observe that if a simple lattice polygon is starshaped with respect to a ray-emitting origin situated at an internal lattice point of the polygon, then our approach reproduces Pick's original formula (1).

The 3D Case
We deal now with the three-dimensional case of lattice polyhedra. Let us define a polyhedron as a bounded region in 3D space whose boundary consists of a finite number of polygonal faces, each pair of which either are disjoint or have a common edge or common single vertex. In addition, we consider polyhedra without self-crossings and assume that each boundary point of a polyhedron has a surface neighborhood homeomorphic to an open disk. A lattice polyhedron is a polyhedron whose vertices are situated on the cubic lattice Z 3 (thus the vertex coordinates are integers). As in the 2D case, the boundary of a lattice polyhedron P is considered a part of P. We also assume that the polyhedra we deal with can be decomposed into primitive tetrahedra, where a primitive tetrahedron [8,Theorem 4.2] is a tetrahedron in R 3 that does not contain any lattice points in its interior or on its boundary other than its vertices (lattice points are the points of the lattice Z 3 ).
Extending Pick-type formulas to 3D lattice polyhedra is not easy. First of all, there are polyhedra that cannot be decomposed into tetrahedra. Second, the following simple counterexample demonstrates that there is no simple analogue of Pick's theorem for polyhedra in 3D [13]. Consider the so-called Reeve tetrahedron, whose vertices have coordinates (0, 0, 0), (1, 0, 0), (0, 1, 0), and (1, 1, r), where r is a positive integer (see Figure 7 for examples of Reeve tetrahedra for r ¼ 2; 3; 4). The tetrahedron has volume equal to r/6 but contains no lattice points in its interior, and the only boundary lattice points are its vertices.
Reeve [13,14] suggested a clever way to generalize Pick's theorem for polyhedra. Given a lattice polyhedron P, his idea is to consider a sublattice Z 3 =n, where n is a positive integer, and construct a formula that takes into account boundary and interior vertices of P in both the original lattice Z 3 and the sublattice. Equivalently, one can consider an inflated polyhedron nP and take into account the numbers of interior and boundary vertices for both the original polyhedron P and its inflated version nP. The resulting formula for the volume VolðPÞ is given by 2ðn À 1Þnðn þ 1ÞVolðPÞ ¼ ð2I n þ B n Þ À nð2I þ BÞ; ð5Þ where I (respectively I n ) is the number of lattice vertices in the interior of P (respectively nP) and B (B n ) is the number of boundary lattice vertices of P (nP) [13,15]. A variety of similar formulas can be obtained if several sublattices, or equivalently, several inflated versions of P, are simultaneously considered [14].
Similar to Pick's theorem, our segment-based approach can be extended to three dimensions if in addition to the original polyhedron P, we consider its inflated version. Namely, let us denote by w I the number of whole vertical lattice segments contained, possibly without their endpoints, in the interior of P (inner segments), by p I the number of partial vertical lattice segments in the interior of P, by w B the number of whole vertical lattice segments contained by oP, and by p B the number of partial vertical lattice segments contained by oP. Here a vertical lattice segment is called a partial interior/boundary segment if it belongs to the lattice, contains no other lattice points except its endpoints, and one of its endpoints belongs to  the interior/boundary of P, while another endpoint is situated outside of P. See Figure 8 for a visual explanation of these different types of segments.
Similar to (4), we define Now our formula for the volume VolðPÞ of a lattice polyhedron P is given by Similar to the 2D case, let us say that a lattice polyhedron P is decomposed into two lattice polyhedra P 1 and P 2 if P ¼ P 1 [ P 2 and the interiors of P 1 and P 2 have empty intersection.
If we decompose a given lattice polyhedron P into two lattice polyhedra P 1 and P 2 , then we have Thus (6) is an additive function on the lattice polyhedra (a lattice valuation) and so is the right-hand side of (7). So it remains to verify that (7) is true for the primitive tetrahedra.
A rigorous verification of (7) on the primitive tetrahedra would likely be tedious. Instead, we use the approach proposed by Reeve [13,14] and further developed by Ehrhart [6]. Consider the dilated lattice polyhedron nP, where n is a positive integer. We claim that where c(P) is a coefficient that depends on the polyhedron P. First, let us show that the leading coefficient of v(nP) is VolðPÞ. Indeed, w B ðnPÞ, p B ðnPÞ, and p I ðnPÞ are Oðn 2 Þ. Each lattice point in the interior of nP contributes to two vertical segments for which the vertex is an endpoint. So the difference between I n , the total number of lattice points in the interior of nP, and w I ðnPÞ is also Oðn 2 Þ. On the other hand, (5) implies that I n ¼ VolðPÞn 3 þ Oðn 2 Þ. Thus w I ðnPÞ ¼ VolðPÞn 3 þ Oðn 2 Þ. Second, one can see that v(nP) is an odd function with respect to n: vðÀnPÞ ¼ ÀvðnPÞ if we deal with directed vertical segments (assume that the positive direction is given by the positive direction of the zaxis). This leads us to (8). (7) and suggests also the following more general result. CONJECTURE (Lattice polyhedron volume via parallel lattice segments). We conjecture that where P is a lattice polyhedron, v(P) is defined by (6), and n [ 1 is an integer.
We formulate it as a conjecture, since our derivation of (8) and (9) (and its particular case (7)) is not complete: we don't have a proof that v(nP) is a polynomial in n.
Below we present results of our calculation of (8) for several polyhedra:

Final Remarks
Our main contribution in this paper was the use of parallel lattice segments for calculating the area of lattice polygons and the volume of 3D lattice polyhedra. These result in formulas (3) and (9). Although (7) and (9) look simple and elegant, more formulas can be derived from (8) if, for example, several dilated versions of the original polyhedron P are considered. It would be interesting to see how our results follow from [5], where a general study of valuations of lattice polygons and polytopes is given.
We have not presented any practical applications of our approach in this paper (obviously there are much more efficient ways to compute the area of a polygon and the volume of a polyhedron [16]). On the other hand, we hope that just as Pick's area theorem led to a number of interesting mathematical results [3,5], our approach may inspire some new developments in discrete and computational geometry.

ACKNOWLEDGMENTS
We would like to thank the reviewer of this paper for insightful comments, suggestions, and questions.

OPEN ACCESS
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http:// creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.    (7), which matches the hexahedron's volume.