Add to ORKGV diplomskem delu preučimo nekatere algoritme za tvorbo 3D konveksne lupine ter opozorimo na njihove prednosti in slabosti. Prav tako jih primerjamo z njihovimi 2D različicami. Podrobneje se posvetimo inkrementalnemu in naivnemu algoritmu, ki ju tudi implementiramo. Oba algoritma med seboj primerjamo glede na hitrost pri različnih porazdelitvah točk.In this thesis, several algorithms for constructing 3D convex shell are considered, and their advantages as well as disadvantages are pointed out. Their 2D versions are briefly described, too. The incremental algorithm and the naive algorithm are studied in greater detailthey have also been implemented. Finally, they have been compared according to the execution speed using different point distr...