This paper presents a new scalable parallelization scheme to generate the 3D Delaunay
triangulation of a given set of points. Our first contribution is an efficient serial …

We propose the first algorithm to compute the 3D Delaunay triangulation (DT) on the GPU.
Our algorithm uses massively parallel point insertion followed by bilateral flipping, a …

Computers with multiple processor cores using shared memory are now ubiquitous. In this
paper, we present several parallel geometric algorithms that specifically target this …

This paper presents a novel approach to compute, for a given point set S in R2, its Delaunay
triangulation T (S). Though prior work mentions the possibility of using the graphics …

This paper presents a robust parallel Delaunay triangulation algorithm called ParaStream
for processing billions of points from nonoverlapped block LiDAR files. The algorithm targets …

A generic parallel Delaunay triangulation scheme by means of zonal partition of points is
proposed. For efficient Delaunay triangulation, points are first sorted into cells, each of which …

Exploring the key technologies of agricultural robots is an inevitable trend in the
development of smart agriculture. It is significant to continuously transplant and develop …

Delaunay refinement is a widely used method for the construction of guaranteed quality
triangular and tetrahedral meshes. We present an algorithm and a software for the parallel …

A method of ray tracing for free-form optical surfaces has been developed. The ray tracing
through such surfaces is based on Delaunay triangulation of the discrete data of the surface …

Of course, there is not enough memory on a PC with 16 GB RAM, and tetrahedra
constructed have to be output to leave rooms for the creation of new tetrahedra in the next …