Manual de desarrollo de algoritmo de extracción de envolvente convexa utilizando paralelización: massively parallel 3D gift-wrapping

Abstract

This guide provides instructions for constructing the 3D convex hull (CH) of a given set of points, whether they originate from the vertices of a triangle mesh or a point cloud. Although there are many algorithms for extracting the CH of a point cloud, we will stick to an easy-to-understand algorithm such as Gift wrapping (also known as Jarvis March). It leverages simplicity by relying on fundamental geometric concepts. However, note that other algorithms are indeed much more efficient. Therefore, another goal of this project is to efficiently extract the CH with massively parallel programming with CUDA (in the Graphics Processing Unit), and OpenMP (in the Central Processing Unit).