Star Decompositions of a Cyclic Polygon
Abstract
Let V be a set of vertices on a circumference in the plane. Let E be a set of directed line segments linking two vertices of V. If E forms a set of closed cycles and for all two adjacent edges uv and vw, the vertices u, v, w are arranged in anti-clockwise order, we call P(V,E) a cyclic polygon. A star decomposition S of a cyclic polygon P is a set of star polygons partitioning the region of P with some additional diagonals. A star decomposition S is called maximal if there is no other star decomposition S' such that a set of diagonals of S is a proper subset of that of S'. In this paper, it is shown that for any two maximal star decompositions S1 and S2 of a common cyclic polygon, S1 can be transformed into S2 by a finite sequence of diagonal flips. It is also shown that if a cyclic polygon P admits a star decomposition, the number of diagonals contained in a maximal star decomposition of P is p - (n-2r)(n-2r-1)/2, where p is the number of all possible diagonals of P, n is the number of vertices of P, and r is the rotation number of P.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.