Sead H. Masovic

Prof. Dr. Sead H. Masovic

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 September 2013 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
PKPredrag V. Krtolica
Predrag V. Krtolica
Muzafer SaračevićMuzafer Saračević
Muzafer Saračević
SMSead H. Masovic
Sead H. Masovic
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.

Verified
Journal Article
Open access
PDF file
Aleksandra RadulovićAleksandra Radulović
Aleksandra Radulović
Dubravka SladićDubravka Sladić
Dubravka Sladić
Aleksandar RisticAleksandar Ristic
Aleksandar Ristic
DJDušan Jovanović
Dušan Jovanović
SMSead H. Masovic
Sead H. Masovic
MGMiro Govedarica
Miro Govedarica
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
Verified
Journal Article
Closed access
PDF file
SMSead H. Masovic
Sead H. Masovic
Muzafer SaračevićMuzafer Saračević
Muzafer Saračević
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
PKPredrag Krtolica
Predrag Krtolica
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.

2 August 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
PKPredrag Krtolica
Predrag Krtolica
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
SMSead H. Masovic
Sead H. Masovic
IEIslam A. ElShaarawy
Islam A. ElShaarawy
АSАlеnа Stupina
Аlеnа Stupina
A polygon with n nodes can be divided into two subpolygons by an internal diagonal through node n. Splitting the polygon along diagonal δi,n and diagonal δn−i,n, i∈{2,…,⌊n/2⌋} results in mirror images. Obviously, there are ⌊n/2⌋−1 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
Verified
Journal Article
Open access
PDF file
SMSead H. Masovic
Sead H. Masovic
IEIslam A. ElShaarawy
Islam A. ElShaarawy
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
PKPredrag Krtolica
Predrag Krtolica
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
Verified
Journal Article
Open access
PDF file
Muzafer SaračevićMuzafer Saračević
Muzafer Saračević
PSPredrag S Stanimirović
Predrag S Stanimirović
SMSead H. Masovic
Sead H. Masovic
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.