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.

Original languageEnglish
Pages (from-to)2866-2876
Number of pages11
JournalCommunications in Statistics Part B: Simulation and Computation
Issue number10
Publication statusPublished - 26 Nov 2019

Scopus subject areas

  • Statistics and Probability
  • Modelling and Simulation

Fingerprint Dive into the research topics of 'Randomized heuristic algorithms for orthogonal projection of a point onto a set'. Together they form a unique fingerprint.

  • Cite this