The investigation of the possibilities of the development of parallel algorithms for computer systems of transputer type, the program realization and estimation are the aim of the paper. As a result the parallel algorithm for constructive operations over polyhedrons for computer systems of transputer type has been developed. Its probabilistic estimation has been obtained. An instrumental medium for the creation of geometrical programs in C language for a transputer net has been developed. The realization of the algorithm and the estimation of its effectiveness have been obtained. The paper results may find their field of application in organizations, engaged in geometrical modellingAvailable from VNTIC / VNTIC - Scientific & Technical Infor...
This paper presents a new approach to Parallel Computational Geometry by using networks of analog co...
This paper describes a new parallel algorithm tbr Minimum Cost Path computation on the Polymorphic P...
Geometric hierarchies have proven useful for the problems of point location in planar subdivisions a...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are...
The object of investigation: the problem of mapping of the computing algorithms on the structure of ...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
Geometric algebra covers a lot of other mathematical systems like vector algebra, complex numbers, P...
Geometric algebra covers a lot of other mathematical systems like vector algebra, complex numbers, P...
Computers with multiple processor cores using shared mem-ory are now ubiquitous. In this paper, we p...
For several years we have developed a scheme for representing polygons and 3D polyhedra by means of ...
We present parallel algorithms for some fundamental problems in computational geometry which have ru...
The electronic prolotyping of a physical object starts with the user completely specifying the probl...
We present parallel algorithms for some fundamental problems in computational geometry which have a ...
An algorithm for the automatic parallel generation of three-dimensional unstructured grids based on ...
This paper is devoted to the development of an algorithmic model that solves a set of interrelated c...
This paper presents a new approach to Parallel Computational Geometry by using networks of analog co...
This paper describes a new parallel algorithm tbr Minimum Cost Path computation on the Polymorphic P...
Geometric hierarchies have proven useful for the problems of point location in planar subdivisions a...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are...
The object of investigation: the problem of mapping of the computing algorithms on the structure of ...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
Geometric algebra covers a lot of other mathematical systems like vector algebra, complex numbers, P...
Geometric algebra covers a lot of other mathematical systems like vector algebra, complex numbers, P...
Computers with multiple processor cores using shared mem-ory are now ubiquitous. In this paper, we p...
For several years we have developed a scheme for representing polygons and 3D polyhedra by means of ...
We present parallel algorithms for some fundamental problems in computational geometry which have ru...
The electronic prolotyping of a physical object starts with the user completely specifying the probl...
We present parallel algorithms for some fundamental problems in computational geometry which have a ...
An algorithm for the automatic parallel generation of three-dimensional unstructured grids based on ...
This paper is devoted to the development of an algorithmic model that solves a set of interrelated c...
This paper presents a new approach to Parallel Computational Geometry by using networks of analog co...
This paper describes a new parallel algorithm tbr Minimum Cost Path computation on the Polymorphic P...
Geometric hierarchies have proven useful for the problems of point location in planar subdivisions a...