Randomized heuristic algorithms for orthogonal projection of a point onto a set

Результат исследований: Научные публикации в периодических изданияхстатья

Выдержка

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.

Язык оригиналаанглийский
Страницы (с-по)2866-2876
Число страниц11
ЖурналCommunications in Statistics Part B: Simulation and Computation
Том48
Номер выпуска10
DOI
СостояниеОпубликовано - 26 ноя 2019

Отпечаток

Orthogonal Projection
Randomized Algorithms
Heuristic algorithms
Heuristic algorithm
Computational geometry
Computer graphics
Robotics
Random Search
Heuristic Search
Computational Geometry
Experiments
Numerical Experiment

Предметные области Scopus

  • Теория вероятности и статистика
  • Моделирование и симуляция

Цитировать

@article{63a04ffffe2541a6afec04f318af632a,
title = "Randomized heuristic algorithms for orthogonal projection of a point onto a set",
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.",
keywords = "Heuristic algorithms, orthogonal projection, random search",
author = "Abbasov, {Majid E.} and Bure, {Vladimir M.}",
year = "2019",
month = "11",
day = "26",
doi = "10.1080/03610918.2018.1469764",
language = "English",
volume = "48",
pages = "2866--2876",
journal = "Communications in Statistics Part B: Simulation and Computation",
issn = "0361-0918",
publisher = "Taylor & Francis",
number = "10",

}

Randomized heuristic algorithms for orthogonal projection of a point onto a set. / Abbasov, Majid E.; Bure, Vladimir M.

В: Communications in Statistics Part B: Simulation and Computation, Том 48, № 10, 26.11.2019, стр. 2866-2876.

Результат исследований: Научные публикации в периодических изданияхстатья

TY - JOUR

T1 - Randomized heuristic algorithms for orthogonal projection of a point onto a set

AU - Abbasov, Majid E.

AU - Bure, Vladimir M.

PY - 2019/11/26

Y1 - 2019/11/26

N2 - 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.

AB - 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.

KW - Heuristic algorithms

KW - orthogonal projection

KW - random search

UR - http://www.scopus.com/inward/record.url?scp=85073257217&partnerID=8YFLogxK

U2 - 10.1080/03610918.2018.1469764

DO - 10.1080/03610918.2018.1469764

M3 - Article

AN - SCOPUS:85073257217

VL - 48

SP - 2866

EP - 2876

JO - Communications in Statistics Part B: Simulation and Computation

JF - Communications in Statistics Part B: Simulation and Computation

SN - 0361-0918

IS - 10

ER -