Solar potential estimation using LiDAR data is an efficient approach for finding suitable roofs
for photovoltaic systems' installations. As the amount of LiDAR data increases, the non …

Incremental algorithms are among the most popular approaches for Delaunay triangulation,
and the point insertion sequence has a substantial impact on the amount of work needed to …

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 …

This paper presents several parallel algorithms for the construction of the Delaunay
triangulation in E2 and E3—one of the fundamental problems in computer graphics. The …

We describe an implementation of a compact parallel algorithm for 3D Delaunay
tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a …

The computation of power diagrams (or weighted Voronoi diagrams) is a fundamental task
in computational geometry and computer graphics. To accomplish the computation, we …

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 …

A parallel algorithm for regular triangulations is presented. For the purpose of fully dynamic
and kinetic particle simulations it allows vertex insertion, deletion, movement, and weight …

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

To increase the efficiency when processing large data sets, a novel parallel algorithm is
proposed for constructing the Delaunay triangulation of a planar point set based on a …