Abstract
The problem of orthogonal projection of a point onto a set is an essential problem of computational geometry. This problem has many practical applications in different areas such as robotics, computer graphics and so on. In the present paper three algorithms for solving this problem are proposed. This algorithms are based on the idea of heuristic random search. Numerical experiments illustrating the work of the proposed methods are presented.
Notes
1 Note
Calculations were made in the mathematical package MATLAB R2013, on a computer with CPU Core i5-3450, 3.1 GHz, 8.00 GB of RAM DDR3 1833MHz, OS Windows 10.