Abstract / Excerpt:

Abstract: This study is an exposition of a mathematical model on the problem of counting the number of disjoint regions into which, the interion of the convex polygon is divided by lines. It uses as well as it illustrates, the following formulas to determine the maximum number of disjoint regions (NR) in the non-regular convex polygon. 1. Number of line segements: NL=1/2n(n-1). 2. Number of Diagonals: ND=1/2/n(n-3). 3. Number of intersection of Diagonals: NI=C9n,4). 4. Number of Additional regions for k entries. 5. Number of additional regions for k entries: ARn=1/6(n-2)(n2-4n+9). Hence, it was found in this study, that the maximum number of disjoint regions (NR) in a non-regular convex polygon determined by n point can be calculated by the following relations of the distinctive characteristics: 1. NR=ND+NI+1. 2. NR = NL+NI-(n-1). 3. NR=NR=mR-n

Info

Source Institution	Ateneo de Davao University
Unit	Social Science
Authors	Villamor, Roland P.
Page Count	1
Place of Publication	Davao City
Original Publication Date	March 3, 2003
Tags	Dissertations, Mathematics

Preview