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. © 2010 Springer Science+Business Media, Inc.