3
24. 11. 2013.
JAVA Implementation for Triangulation of Convex Polygon Based on Lukasiewicz’s Algorithm and Binary Trees
Triangulation of the polygon is one of the fundamental algorithm computational geometry. This paper describes one method triangulations of a convex polygon. The notation that is obtained is expressed in the form of binary records. A presented method of triangulations is based on Lukasiewicz's algorithm and binary trees. Particularly, we present the implementation for creating binary for triangulation polygons. As evaluation of presented method we provide Java implementation for binary notation for triangulation polygons. Java application displays a correlation betwe notation and the graphical representation. of recording of polygon