Faruk Selimović, Predrag Stanimirović, Muzafer Saračević, Selver Pepić

DOI Number
First page
Last page


A method of encryption of the 3D plane in Geographic Information Systems (GIS) is presented. The method is derived using Voronoi-Delaunay triangulation and properties of Catalan numbers. The Voronoi-Delaunay incremental algorithm is presented as one of the most commonly used triangulation techniques for random point selection. In accordance with the multiple applications of Catalan numbers in solving combinatorial problems and their "bit-balanced" characteristic, the process of encrypting and decrypting the coordinates of points using the Lattice Path method (walk on the integer lattice) or LIFO model is given. The triangulation of the plane started using decimal coordinates of a set of given planar points. Afterward, the resulting decimal values of the coordinates are converted to corresponding binary records and the encryption process starts by a random selection of the Catalan key according to the LIFO model. These binary coordinates are again converted into their original decimal values, which enables the process of encrypted triangulation. The original triangulation of the plane can be generated by restarting the triangulation algorithm. Due to its exceptional efficiency in terms of launching programs on various computer architectures and operating systems, Java programming language enables an efficient implementation of our method.


Encryption of 3D plane; Voronoi-Delaunay triangulation; Catalan numbers; Lattice Path method; Java Net- Beans environment.

Full Text:



Heywood I., Cornelius S., Carver S., An Introduction to Geographical Information Systems, Pearson Education: Prentice-Hall, 2012.

Koshy T., Catalan Numbers with Applications, Oxford University Press, New York 2009.

Saračević, M., Stanimirović, P., Krtolica, P., Mašović, S., Construction and Notation of Convex Polygon Triangulation based on ballot problem, ROMJIST - Journal of Information Science and Technology, 17(3), pp. 237-251, 2014.

Geary, F.R., Rahman, N., Raman, R., A Simple Optimal Representation for Balanced Parentheses, Theoretical Computer Science, 368 (3), pp. 231-246, 2006.

Berg M., Cheong O., Kreveld M., Overmars M., Computational Geometry: Algorithms and Applications (3rd Edition), Springer 2008.

Sisti A. F., Farr S. D., Modeling and simulation enabling technologies for military applications, Proceedings Winter Simulation Conference, California, USA, pp. 877-883, 1996.

Saračević M., Aybeyan S., Selimovic F., Generation of cryptographic keys with algorithm of polygon triangulation and Catalan numbers, Computer Science - AGH, 19(3), pp. 243–256, 2018.

Saračević M., Koricanin E., Bisevac E., Encryption based on Ballot, Stack permutations and Balanced Parentheses using Catalan-keys, Journal of Information Technology and Applications, 7(2), pp. 69–77, 2017.

Saračević M., Adamovic S., Bisevac E., Application of Catalan Numbers and the Lattice Path Combinatorial Problem in Cryptography, Acta Polytechnica Hungarica - Journal of applied sciences, 15(7), pp. 91–110, 2018.

Lee D.T., Preparata F.P., Computational Geometry - A Survey, IEEE Transactions On Computers, Vol c-33 (12), 1984.

DOI: https://doi.org/10.22190/FUMI2004205S


  • There are currently no refbacks.

© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)