Sums of Interior Angles of n-Star ConvexPolygons And Related Problems
碩士 === 國立中山大學 === 應用數學系研究所 === 89 === Every (convex) star polygon with n vertices can be associated with a permutation on {1,2, . . . , n } . It is known that the sum of interior angles of the polygon is solely determined by ˙. In this thesis, we give an exact formula to calculate the sum of interio...
Main Authors: | Meng-Han Li, 李孟翰 |
---|---|
Other Authors: | Ngai-Ching Wong |
Format: | Others |
Language: | en_US |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/37666540894703918016 |
Similar Items
-
A Study of Seven Graders’ Formation of the Sum of Interior Angles in a Polygon
by: Yi-Tsen Lai, et al.
Published: (2012) -
Containment of convex polygon
by: GUO, YI-XIANG, et al.
Published: (1987) -
On k-convex polygons
by: Aichholzer, Oswin, et al.
Published: (2014) -
A Study of Instructional Technology in Exploring the Learning of Plane Geometry in the 5th graders - Take Polygons and the Sum of Interior Angles as examples
by: CHEN HSIN-I, et al.
Published: (2007) -
Nonobtuse triangulations of convex polygons
by: YOU, CAN-YING, et al.
Published: (1992)