The goal of this study is the analysis and comparison of algorithms for computing the convex hull of a set in two-dimensional and three-dimensional space. Explained algorithms for calculating the convex hull in the plane are Graham’s algorithm, Divide-and-conquer algorithm, Jarvis’ march and Chan’s algorithm. It was found that the complexity of Graham’s algorithm and Divide-and-conquer algorithm is O(n log n). Jarvis’ and Chan’s algorithm belong to output-sensitive algorithms. The complexity of Jarvis’ march is O(hn) while the complexity of Chan’s algorithm is O(h log n). When h is asymptotically smaller than log n, the Jarvis algorithm is a better choice than the Graham algorithm. It can be concluded that Chan’s algorithm has the best time of the above. What is interesting is that he uses the Graham and Jarvis algorithm in his implementation. To calculate the convex hull in three-dimensional space, an incremental algorithm was studied. The analysis and implementation of that algorithm is much more complex than the previous ones. Its complexity is O(n log n). Examples of the use of convex hulls are described in Voronoi diagram and Delaunay triangulation.