Predrag Krtolica

Dr. Predrag Krtolica


Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
22 May 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Faruk SelimovićFaruk Selimović
Faruk Selimović
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
Muzafer SaračevićMuzafer Saračević
Muzafer Saračević
PKPredrag Krtolica
Predrag Krtolica
This paper presents a new method of steganography based on a combination of Catalan objects and Voronoi–Delaunay triangulation. Two segments are described within the proposed method. The first segment describes the process of embedding data and generating a complex stego key. The second segment explains the extraction of a hidden message. The main goal of this paper is to transfer a message via the Internet (or some other medium) using an image so that the image remains absolutely unchanged. In this way, we prevented the potential attacker from noticing some secret message hidden in that picture. Additionally, the complex stego key consists of three completely different parts (the image, the encrypted Delaunay triangulation, and the array Rk in Base64 code), which are very difficult to relate with each other. Finally, a few security analyses of the proposed method are conducted, as well as the corresponding steganalysis.

1 January 2020 in Acta Polytechnica Hungarica
Verified
Journal Article
Closed access
Faruk SelimovićFaruk Selimović
Faruk Selimović
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
Muzafer SaračevićMuzafer Saračević
Muzafer Saračević
Aybeyan SelimAybeyan Selim
Aybeyan Selim
PKPredrag Krtolica
Predrag Krtolica

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.

15 April 2018 in Facta Universitatis, Series: Mathematics and Informatics
Verified
Journal Article
Closed access
PDF file
PKPredrag Krtolica
Predrag Krtolica
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
ISIgor Stojanović
Igor Stojanović
A particular integer sequence derived by the convex polygon triangulation is introduced and investigated. After some underlying results are presented, the forbidden (or improper) integer values relative to the triangulation are concerned. It is understood that the forbidden sequences do not correspond to any triangulation. Some of their properties are presented. These properties are used to count the forbidden values, which is, finally, exploited in stating another decomposition of the Catalan number.

1 January 2007 in Filomat
Verified
Journal Article
Open access
Predrag S. StanimirovicPredrag S. Stanimirovic
Predrag S. Stanimirovic
MTMilan Tasic
Milan Tasic
PKPredrag Krtolica
Predrag Krtolica
NKNikolas Karampetakis
Nikolas Karampetakis
We investigate two algorithms for computing the Moore-Penrose and Drazin inverse of a given one-variable polynomial matrix by interpolation. These algorithms differ in the method used for constant matrices inverses computing. The first algorithm uses the Grevile?s method, and the second one uses the Leverrier-Faddeev method and its generalization. These algorithms are especially useful for symbolic computation in procedural programming languages. We compare results by implementing the algorithms in the programming package MATHEMATICA and in the procedural programming languages DELPHI and C++.