Numerical Calculation of Area of Elliptical Segments

: In this paper, we introduce the notion of an elliptical segment as some analogy of the circular segment and we focus on the problem of calculation of its area. Based on the analytical method, we derive the formulas, which can be used for the numerical approximation of the area of the given segment.


Introduction
In this paper, we present the problem of calculation of the area of elliptical segment. The notion elliptical segment is a generalization of the term circular segment. In accordance with this analogy, we consider the elliptical segment as a set of points surrounded by a given elliptical arc and its chord. The figures in Figure 1 are the segments illustrated as the shaded regions. There exist a few formulas about how to calculate the area A of the given circular segment. Their proving is based on the idea of subtraction of the area of the circular sector and the area of the subsistent triangle portion [1]. In this concept, the term central angle is crucial, but it is undefined for the ellipse [2]. The Gauss-Green formula is used to determine an elliptical sector area. It leads to an algorithm for calculating the area of the elliptical segment [3].
Our approach to the problem of the area of the elliptical segment is different. First, we prefer analytical method. Based on the idea of definite integral, we tessellate the given segment by polygons (trapezoids) and, consecutively, we derive a formula approximately evaluated the reflected area. Finally, we present an interesting corollaries of the results related to the area of the given ellipse.

Elliptical Segment
First, we consider an ellipse in its central equation with center in the origin of Cartesian coordinate system Oxy. The straight line, determined by the chord of the conic, is defined in its slope-intercept form [4]. In Cartesian coordinate system Oxy, the ellipse is given by the equation for 0 < b < a, a, b ∈ R and let p be the line of the form for k, q ∈ R. The line p must be a secant line. We show that Generally, let us consider an arbitrary parallel line in the equation where q i ∈ R.
Suppose that the line in Equation (3) intersects the ellipse in points U i , V i . Their coordinates must be derived by solving an equation . .
We evaluate the discriminant D where D i = a 2 k 2 + b 2 − q 2 i . The points of intersection exist, if and only if D i ≥ 0. It implies that The line p also determines the chord UV of the given ellipse, if and only if as it was necessary to prove. It also holds true that • if D i > 0, then there exists an one-to-one correspondence between the pair of points U i , V i and the intercept q i .
These points of intersection have the coordinates The lines in the equation y = kx ± √ a 2 k 2 + b 2 are tangent lines to the given ellipse.
We label t P the tangent line in the equation y = kx + √ a 2 k 2 + b 2 and t Q will be the tangent line in the equation The tangent lines t P , t Q demarcate the strip in which the ellipse lies. The condition (5) also determines that each of the lines in Equation (3) belongs to this strip. Later, we use the points of intersection as the vertices of polygons which approximately tessellate the given elliptical segment.
Without loss of generality, in the next section, we consider that the elliptical segment lies between the lines t Q and the line p.

Arithmetic Sequence of Intercepts
To determine the vertices of the polygons, we introduce the intercepts q i as an arithmetic sequence {q i } n i=0 such that for i = 0, 1, 2, . . . , n, where n ∈ N is fixed and d > 0 is a difference of the sequence. Its value is bounded too. We determine it as follows: The inequalities (9) result in This result allows us to put This setting of the difference d has a geometric meaning. The line segment on the axis y, bounded by the points 0, − √ a 2 k 2 + b 2 , (0, q), is fragmented to n particular segments of the equal length d.

Approximation of Elliptical Segment
First, we construct the set of the lines, each in the equation y = kx + q i for the arithmetical sequence {q i } n i=0 with its difference d. We determine the points of intersection with the ellipse and draw the triangle U 0 U 1 V 1 and the trapezoids U i V i V i+1 U i+1 for i = 1, 2, . . . , n − 1. They approximate the elliptical segment.

It holds true that
In this setting of the intercept q i we derive that for D i it holds true where the difference d is determined by (12).
The area A e of the elliptical segment is approximately equal to the area A (n,d) where h i is a height of the trapezoid. If we label k = tan ϕ (Figure 2), then we derive Example 1. Approximately calculate the area of a semi-ellipse with axes a = 3, b = 2 for n ≤ 10.
Solution. The semi-ellipse is a special case of the elliptical segment for q = 0. If we apply it in the Formulas (10), (12), and (13), then we derive It is evident that k is a free parameter. It has also a geometric explanation-the line p passing through the center of the ellipse divides the ellipse in half.
Due to the simplicity of the calculation, we put k = 0 and we organize data in Table 1. Similarly, the reader can also verify some results listed in Table 2.   The visualizations with the different partition number n are shown in Figure 3. A (n,d) 6.00 8.20 8.75 8.99 9.11 9.19 9.24 9.27 9.29 9.31

Estimation of Area of Ellipse
In the case, when the line p is identical with the tangent line t P , the elliptical segment is prolonged to the complete ellipse and we have It holds that and we derive By analogy, The result (15) is simplified as follows: We modify the Formula (17) in the form The independence on the slope k has a geometric interpretation too. We can approximate the ellipse by many polygonal tessellations related to the value of the slope k. They need to not be congruent, but their areas are equal. Some samples are in (Figure 4). We have demonstrated that the Formula (18) can be used to numerical approximation and its value depends on n-the number of the polygons which tessellate the given ellipse. We estimate A (n,d) .
Let us consider the function f (x) = x n − x 2 n 2 for x > 0 and fixed n ∈ N. We show that this function is bounded.
It is evident that the domain of function is [0, n] and the function is bounded from below. Its minimum is m = 0 for x = 0. We find a maximum M by using its derivatives: To find a stationary point, we set f (x) = 0 and we derive x 0 = n 2 . The second derivative f (x) is and it holds true that The function f (x) has in x 0 = n 2 a global maximum M = 1 2 and it implies that

Area of Ellipse-Exactly
The area A of the given ellipse in Equation (1) can be evaluated by using definite integral [5]. It holds true that a cos t a 2 − a 2 sin 2 t dt = · · · = ab The result implies that it holds A = πab.
Finally, from (18), we can also derive this interesting result It implies that This result can be verified in geometrical way too. If we apply the idea of Darboux integral [6], then we obtain The Figure 5 presents the graph of the function y = √ x − x 2 . It is the semicircle with the center O( 1 2 , 0) and the radius r = 1 2 . It is evident that its area is equal to A = πr 2 2 = · · · = π 8 .