In this study we address the problem of ecient parallel triangulation methods for a nite set of points in the plane. The main goals of the research were to identify scalable algorithms which achieve a signicant speedup over the sequential solutions and to implement and evaluate their performance on a parallel machine. Two approaches for parallel triangulation, one of which relies on global sorting, are fully described and implemented on a hypercube. Extensive performanc
A new computational paradigm is described which o ers the possibility ofsuperlinear (and sometimes u...
Nowadays, digital representations of real objects are becoming bigger as scanning processes are mor...
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithm...
In this study we address the problem of efficient parallel triangulation methods for a finite set of...
Abstract. A triangulation of points in , or a tetrahedronization of points in , is used in many appl...
AbstractComputers with multiple processor cores using shared memory are now ubiquitous. In this pape...
The thesis deals with the problem of triangulation in a real plane using a graphics processing unit,...
Computers with multiple processor cores using shared mem-ory are now ubiquitous. In this paper, we p...
This thesis gives an overview of parallel techniques used in co mputer graphics. It investigates t...
We present parallel algorithms for some fundamental problems in computational geometry which have ru...
We studyscalable parallel computational geometry algorithms for the coarse grained multicomputer mod...
Today’s applications need to process large data sets using several processors with a shared memory, ...
We present parallel algorithms for some fundamental problems in computational geometry which have a ...
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we pr...
Abstract. A triangulation of points in , or a tetrahedronization of points in, is used in many appli...
A new computational paradigm is described which o ers the possibility ofsuperlinear (and sometimes u...
Nowadays, digital representations of real objects are becoming bigger as scanning processes are mor...
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithm...
In this study we address the problem of efficient parallel triangulation methods for a finite set of...
Abstract. A triangulation of points in , or a tetrahedronization of points in , is used in many appl...
AbstractComputers with multiple processor cores using shared memory are now ubiquitous. In this pape...
The thesis deals with the problem of triangulation in a real plane using a graphics processing unit,...
Computers with multiple processor cores using shared mem-ory are now ubiquitous. In this paper, we p...
This thesis gives an overview of parallel techniques used in co mputer graphics. It investigates t...
We present parallel algorithms for some fundamental problems in computational geometry which have ru...
We studyscalable parallel computational geometry algorithms for the coarse grained multicomputer mod...
Today’s applications need to process large data sets using several processors with a shared memory, ...
We present parallel algorithms for some fundamental problems in computational geometry which have a ...
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we pr...
Abstract. A triangulation of points in , or a tetrahedronization of points in, is used in many appli...
A new computational paradigm is described which o ers the possibility ofsuperlinear (and sometimes u...
Nowadays, digital representations of real objects are becoming bigger as scanning processes are mor...
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithm...