Один підхід розв'язання задач обчислювальної геометрії на основі рекурсивно-паралельного алгоритму.

This article is devoted to the generalized approach of the effective decision of problems of computing geometry which initial data are set of points in Euclidean planes. The basis of this approach is construction recursion-parallel algorithm by means of strategy «distribute and dominate». In particular, on an example of a problem of a finding of a convex environment of set of points, it is offered recursion-parallel algorithm of its decision.