The presented algorithm for constructing the Voronoi diagrams in plane for a finite set of points $S$ consists of two parts. In the first part the Voronoi polygons are constructed for the points of the convex hull of $S$, while in the second part, these polygons are constructed for the points of the interior region of the convex hull. The algorithm has been implemented in Pascal.