Sead H. Mašović
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sead H. Mašović has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Muzafer Saračević
Department of Economics and Computer Sciences, University of Novi Pazar, Dimitrija Tucovića 65, 36300 Novi Pazar, Serbia
6 shared publications - Predrag S. Stanimirovic
Faculty of Sciences and Mathematics, University of Niš, Niš, Serbia
5 shared publications - Predrag Krtolica
Faculty of Sciences and Mathematics, University of Niš, Višegradska 33, 18000 Niš, Serbia
3 shared publications - Islam A. Elshaarawy
Faculty of Engineering (at Shoubra), Benha University, Cairo 11672, Egypt
2 shared publications - Aleksandar Ristić
Computing and Control Department, University of Novi Sad, 21000 Novi Sad, Serbia
1 shared publication - Aleksandra Radulović
Faculty of Technical Sciences, University of Novi Sad, 21000 Novi Sad, Serbia
1 shared publication
Latest Publications
- Open Access
- 28 September 2025
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 14 (10) , 380
The LADM Spatial Plan Information Country Profile for Serbia
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.
- 28 September 2025
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 14 (10) , 380
Open AccessThe LADM Spatial Plan Information Country Profile for Serbia
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.
- Open Access
Convex Polygon Triangulation Based on Symmetry
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.Open AccessConvex Polygon Triangulation Based on Symmetry
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. - 13 March 2019
- Published by University of Nis in Facta Universitatis, Series: Mathematics and Informatics
- Vol. 34 (1) , 137-147
COMPUTING TRIANGULATIONS OF THE CONVEX POLYGON IN PHP/MYSQL ENVIRONMENT
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.
- 13 March 2019
- Published by University of Nis in Facta Universitatis, Series: Mathematics and Informatics
- Vol. 34 (1) , 137-147
COMPUTING TRIANGULATIONS OF THE CONVEX POLYGON IN PHP/MYSQL ENVIRONMENT
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.
- Open Access
- 1 January 2018
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 12 (2) , 439-454
Orbiting triangle method for convex polygon triangulation
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.
- 1 January 2018
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 12 (2) , 439-454
Open AccessOrbiting triangle method for convex polygon triangulation
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.
- Open Access
- 17 December 2014
- Published by International University of Sarajevo in Southeast Europe Journal of Soft Computing
- Vol. 3 (2)
Finding optimal triangulation based on block method
In this paper we give one new proposal in finding optimal triangulation which is based on our authorial method for generating triangulation (Block method). We present two cases in calculation the triangulation weights (classical case and case based on block method). We also provide their equality and established relationship in calculation the weights for both models, with an emphasis on simplicity of calculations which occurs in the second case. The main goal of this paper is on the speed of obtaining optimal triangulation.
- 17 December 2014
- Published by International University of Sarajevo in Southeast Europe Journal of Soft Computing
- Vol. 3 (2)
Open AccessFinding optimal triangulation based on block method
In this paper we give one new proposal in finding optimal triangulation which is based on our authorial method for generating triangulation (Block method). We present two cases in calculation the triangulation weights (classical case and case based on block method). We also provide their equality and established relationship in calculation the weights for both models, with an emphasis on simplicity of calculations which occurs in the second case. The main goal of this paper is on the speed of obtaining optimal triangulation.
- 27 January 2014
- Published by Óbuda University in Acta Polytechnica Hungarica
- Vol. 11 (1)
Alpha-Numeric Notation for one Data Structure in Software Engineering
This paper presents one way to store balanced parentheses notations in shortened form in order to lower memory usage. Balanced parentheses strings are one of the most important of the many discrete structures. We propose new method in software engineering for storing strings of balanced parentheses in shortened form as Alphanumeric (AN) notation. In addition, our algorithm allows a simple reconstruction of the original strings. Another advantage of the presented method is reflected in savings of working memory when it comes to deal with combinatorial problems. The proposed method is implemented in Java environment.
- 27 January 2014
- Published by Óbuda University in Acta Polytechnica Hungarica
- Vol. 11 (1)
Alpha-Numeric Notation for one Data Structure in Software Engineering
This paper presents one way to store balanced parentheses notations in shortened form in order to lower memory usage. Balanced parentheses strings are one of the most important of the many discrete structures. We propose new method in software engineering for storing strings of balanced parentheses in shortened form as Alphanumeric (AN) notation. In addition, our algorithm allows a simple reconstruction of the original strings. Another advantage of the presented method is reflected in savings of working memory when it comes to deal with combinatorial problems. The proposed method is implemented in Java environment.
- Open Access
- 25 December 2013
- Published by National and University Library of the Republic of Srpska in JITA - Journal of Information Technology and Applications (Banja Luka) - APEIRON
- Vol. 6 (2)
Object-Oriented Analysis and Design for one Algorithm of Computational Geometry: Forward, Reverse and Round-Trip Engineering
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.
- 25 December 2013
- Published by National and University Library of the Republic of Srpska in JITA - Journal of Information Technology and Applications (Banja Luka) - APEIRON
- Vol. 6 (2)
Open AccessObject-Oriented Analysis and Design for one Algorithm of Computational Geometry: Forward, Reverse and Round-Trip Engineering
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.
- 24 September 2013
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 91 (6) , 1315-1328
Decomposition of Catalan numbers and convex polygon triangulations
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.
- 24 September 2013
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 91 (6) , 1315-1328
Decomposition of Catalan numbers and convex polygon triangulations
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.
- Open Access
- 1 January 2013
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Ekonomski izazovi
- Vol. 2 (3) , 39-48
Implementation of the transportation problem based on meta-heuristics approach method
In this paper is listed the analysis and implementation of possible solutions to the vehicle routing problem based on simulated annealing method, which belongs to the category of meta-heuristics approaches. The described method is a complex problem of linear programming from the field of operations research. This paper presents testing results of applications developed in programming package MATHEMATICA which provides great features when it comes to working with numerical algorithms, as well as in the field of symbolic and algebraic calculations.
- 1 January 2013
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Ekonomski izazovi
- Vol. 2 (3) , 39-48
Open AccessImplementation of the transportation problem based on meta-heuristics approach method
In this paper is listed the analysis and implementation of possible solutions to the vehicle routing problem based on simulated annealing method, which belongs to the category of meta-heuristics approaches. The described method is a complex problem of linear programming from the field of operations research. This paper presents testing results of applications developed in programming package MATHEMATICA which provides great features when it comes to working with numerical algorithms, as well as in the field of symbolic and algebraic calculations.