Convex polygon triangulation based on planted trivalent binary tree and ballot problem
| Autor: | Aybeyan Selimi, Muzafer Saračević |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Discrete mathematics
Binary tree General Computer Science Hierarchy (mathematics) Basis (linear algebra) Computer science Mühendislik Triangulation (social science) 020206 networking & telecommunications 02 engineering and technology Computer Science::Computational Geometry Computational geometry Convex polygon Catalan number Engineering TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Polygon 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Computational geometry triangulation Catalan number planted trivalent binary tree ballot notation MathematicsofComputing_DISCRETEMATHEMATICS ComputingMethodologies_COMPUTERGRAPHICS |
| Zdroj: | Volume: 27, Issue: 1 346-361 Turkish Journal of Electrical Engineering and Computer Science |
| ISSN: | 1303-6203 1300-0632 |
| DOI: | 10.3906/elk-1805-143 |
| Popis: | This paper presents a new technique of generation of convex polygon triangulation based on planted trivalent binary tree and ballot notation. The properties of the Catalan numbers were examined and their decomposition and application in developing the hierarchy and triangulation trees were analyzed. The method of storage and processing of triangulation was constructed on the basis of movements through the polygon. This method was derived from vertices and leaves of the planted trivalent binary tree. The research subject of the paper is analysis and comparison of a constructed method for solving of convex polygon triangulation problem with other methods and generating graphical representation. The application code of the algorithms was done in the Java programming language. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|