Add to ORKGFor several years we have developed a scheme for representing polygons and 3D polyhedra by means of layers of triangles and tetrahedra, together with effective algorithms for basic geometric operations on the represented objects. In this paper we explore the optimization of some of these algorithms by parallel processing techniques
Abstract. A new data-parallel algorithm for reconstructing smooth surfaces defined by arbitrary 3D t...
AbstractComputers with multiple processor cores using shared memory are now ubiquitous. In this pape...
To design objects or entire scenes in real time with free-form surfaces makes a shifting process to ...
For several years we have developed a scheme for representing polygons and 3D polyhedra by means of ...
The investigation of the possibilities of the development of parallel algorithms for computer system...
As the resolution of simulation models increases, scientific visualization algorithms which take adv...
This work describes a decomposition scheme for polyhedra called Layer-based decomposition. This deco...
In order to prepare modern finite element analysis a program for the efficient parallel generation ...
An algorithm for the automatic parallel generation of three-dimensional unstructured grids based on ...
Geometric hierarchies have proven useful for the problems of point location in planar subdivisions a...
The aim of the computer graphics is to visualise models of real-world objects. The visualization of ...
Computers with multiple processor cores using shared mem-ory are now ubiquitous. In this paper, we p...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are...
This paper describes the design and the analysis of parallel algorithms for the interpretation of pl...
[EN]We propose a new algorithm on distributed-memory parallel computers for our simultaneous untangl...
Abstract. A new data-parallel algorithm for reconstructing smooth surfaces defined by arbitrary 3D t...
AbstractComputers with multiple processor cores using shared memory are now ubiquitous. In this pape...
To design objects or entire scenes in real time with free-form surfaces makes a shifting process to ...
For several years we have developed a scheme for representing polygons and 3D polyhedra by means of ...
The investigation of the possibilities of the development of parallel algorithms for computer system...
As the resolution of simulation models increases, scientific visualization algorithms which take adv...
This work describes a decomposition scheme for polyhedra called Layer-based decomposition. This deco...
In order to prepare modern finite element analysis a program for the efficient parallel generation ...
An algorithm for the automatic parallel generation of three-dimensional unstructured grids based on ...
Geometric hierarchies have proven useful for the problems of point location in planar subdivisions a...
The aim of the computer graphics is to visualise models of real-world objects. The visualization of ...
Computers with multiple processor cores using shared mem-ory are now ubiquitous. In this paper, we p...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are...
This paper describes the design and the analysis of parallel algorithms for the interpretation of pl...
[EN]We propose a new algorithm on distributed-memory parallel computers for our simultaneous untangl...
Abstract. A new data-parallel algorithm for reconstructing smooth surfaces defined by arbitrary 3D t...
AbstractComputers with multiple processor cores using shared memory are now ubiquitous. In this pape...
To design objects or entire scenes in real time with free-form surfaces makes a shifting process to ...