Construction and Notation of Convex Polygon Triangulation Based on Ballot Problem
. In this paper we provide a new way for constructing and storing the convex polygon triangulations. The main motivation for the presented method is derived from two combinatorial problems: ballot problem and problem of lattice path . The method is derived upon the so-called movement through polygon. The movement is de(cid:12)ned on ballot records and validity of the lattice path through the grid. We give two algorithms: Triangulation to ballot and Ballot to triangulation . Also, we give a method to make coding for a ballot record or the corresponding triangulation even more compact using a stack. All mentioned algorithms are implemented in the Java programming language.