Recursion and parallel algorithms in geometric modeling problems

Abstract

An efficient approach to the accurate computer modeling of phenomena and processes is discussed. The "divide-and-conquer" technique is used to develop a generalized parallel-recursive algorithm for simultaneous solution of a collection of interrelated problems that use a common unified data structure (weighted concatenable queue) at the merge stage. The decomposition stage is common and is executed only once for all tasks. These means are efficient and convenient for constructing and studying complex computational models.

Application of concatenable queue for parallel computational geometry algorithms

“…This tool should also execute identical steps of the algorithms once and be able to represent the results of those steps in the form of unified data structures. In [TA10] the notion of a unified algorithmic environment is introduced, which is based on the "divide-and-conquer" principle and takes into account the aforementioned features of the algorithms. In particular, preprocessing and dividing the initial set of data to form a recursion tree is common for all problems and is executed only once.…”

Деякі Питання Створення Концептуальної Моделі Інформаційної Системи Управління Оздоровленням Військовослужбовців

“…МЄАС використовує загальну структуру даних і набір спільних алгоритмічних інструментів та процедур для комп'ютерного моделювання та візуалізації результатів розв'язання широкого класу прикладних задач [17][18][19].…”