In this paper we present a method for Catalan number decomposition in the expressions of the form (2+i). This method gives convex polygon triangulations in Hurtado–Noy ordering. Therefore, we made a relationship between the expressions and the ordering mentioned above. The corresponding algorithm for Catalan number decomposition is developed and implemented in Java, as well as the algorithm which generates convex polygon triangulations. At the end, we have provided the comparison of Hurtado's algorithm and our algorithm based on the decomposition method.
Spatial planning deals with the organization and regulation of space with the goal to improve the quality of life of its inhabitants. Spatial planning plays a vital role in land administration, encompassing land development, management, land use assessment, resource allocation, and environmental protection. The significance of integrating spatial-planning information into the ISO 19152 Land Administration Domain Model (LADM) framework has been recognized in the LADM second edition, Part 5, where a part for spatial plan information is introduced. The aim of this paper is to analyze the applicability of the LADM Part 5: Spatial Plan Information draft international standard to the Serbian spatial and urban planning system and to develop a country profile for Serbia in alignment with Serbian laws and regulations. An analysis of spatial and urban planning in Serbia will be performed, determining the hierarchy of spatial and urban plans based on an analysis of laws on spatial planning. The created conceptual model for spatial planning for Serbia based on the LADM Part 5: Spatial Plan Information will be harmonized with the previously created LADM country profile for Serbia.
13 March 2019 in Facta Universitatis, Series: Mathematics and Informatics
In this paper we implement Block method for convex polygon triangulation in web environment (PHP/MySQL). Our main aim is to show the advantages of usage of web technologies in performing complex algorithm from computer graphics. The basic assumption is that one obtained results we store in database and use it for other calculation. Databases are convenient and structured methods of sharing and retrieving data. We have performed a comparative analysis of developed program with respect to two criteria: CPU time in generating triangulation and CPU time in reading results from database.
A polygon with n nodes can be divided into two subpolygons by an internal diagonal through node n. Splitting the polygon along diagonal and diagonal , results in mirror images. Obviously, there are pairs of these reflectively symmetrical images. The influence of the observed symmetry on polygon triangulation is studied. The central result of this research is the construction of an efficient algorithm used for generating convex polygon triangulations in minimal time and without generating repeat triangulations. The proposed algorithm uses the diagonal values of the Catalan triangle to avoid duplicate triangulations with negligible computational costs and provides significant speedups compared to known methods.
1 January 2018 in Applicable Analysis and Discrete Mathematics
Finding all possible triangulations of convex polygon is a highly time and memory space consuming combinatorial problem. Therefore, it is very important to develop algorithms for generating triangulations as efficiently as possible. This paper presents a new method for generating triangulations of a convex polygon, called Orbiting triangle method (OTM). The method is based on using the set of (n-1)-gon triangulations during the set of n-gon triangulations creation. The main feature of the OTM algorithm is the use of the Catalan triangle to identify valid triangulations, so that the algorithm spends almost no time to eliminate duplicates. In this way, the method possesses small complexity and saves the computational time required for detecting and eliminating duplicates.
25 December 2013 in JITA - Journal of Information Technology and Applications (Banja Luka) - APEIRON
Triangulation of the polygon is a fundamental algorithm in computational geometry. This paper considers techniques of object-oriented analysis and design as a new tool for solving and analyzing convex polygon triangulation. The triangulation is analyzed from three aspects: forward, reverse and round-trip engineering. We give a suggestion for improving the obtained software solution of the polygon triangulation algorithm using technique that combines UML modeling and Java programming.