Algorithms on finite sets of vectors and space points

In this paper we construct the computational algorithms on finite sets of vectors that allow to find the number of equivalence classes of these sets relative to the vector collinearity relation, and the number of two-dimensional subsets defined by all pairs of vectors from the set. We show the application of these algorithms to solution of two combinatorial problems for finite sets of space points.