Tereshchenko V. The construction of a single algorithmic environment for solving complex problems of computational geometry

The thesis is devoted to developing a new algorithmic model - model of common parallel-and- recursive algorithmic environment, - which solves an important scientific problem creation the efficient means of computer modeling and visualization that is a holistic methodology to develop new generations of CAD / CAM systems. The basis of the proposed model it is generalized parallel-and-recursive algorithm that use "divide and conquer" technique. It uses to all complex of problems the common algorithmic tools: a data structure (weighted concatenable queue ), steps of merger, pre-processing and dividing.The new efficient parallel-and-recursive merge procedures for complex of problems are developed. Generalization of the principle of reduction gave a general approach for establishing estimates of complexity and constructing of efficient algorithms for solving problems of computational geometry. Approaches that have been proposed in the work applied to solving problems of computational geometry, thermal modeling of welding processes, regional analysis and pattern recognition.