JAVA Implementation for Triangulation of Convex Polygon Based on Lukasiewicz’s Algorithm and Binary Trees

Abstract

Triangulation of the polygon is one of the fundamental algorithms in computational geometry. This paper describes one method of recording triangulations of a convex polygon. The notation that is obtained is expressed in the form of binary records. A presented method of storing triangulations is based on Lukasiewicz's algorithm and binary trees. Particularly, we present the implementation for creating binary records for triangulation polygons. As evaluation of presented method we provide Java implementation for binary notation for triangulation polygons. Java application displays a correlation between the binary notation and the graphical representation.