This repository contains the developments and results I achieved during the small GMT project (INFOMSPGMT) held from September 5th to December 1st 2023 and supervised by Frank Staals at Utrecht University. In his (not yet published) notes, F. Staals introduces an efficient parallel algorithm for computing 3d lower envelopes. The logic of such an algorithm is assembled with multiple sub-routines solving specific problems in a parallel fashion. This project aims to investigate the practical feasibility of such an efficient algorithm and its components and provide a working implementation in C++. In addition, we want to investigate the relationship between theoretical complexities and running times of such implementations as the input size and number of processors is increased. For more information, you can refer to the project's final report and presentation slides.
The building process has been tested on Windows 11 and Visual Studio 17 2022. It should work also for MacOS and Linux but additional steps are required. For further information, please refer to CGAL's documentation.
Clone the project
$ git clone --recurse-submodules https://github.com/gianmarcopicarella/ga-spgmt-uu.gitGo to the project directory
$ cd ga-spgmt-uuRun the install script
$ .\script\cgal-install-windows.ps1Run the CMake script
$ .\script\src-build-windows.ps1CMake, C++, CGAL, Intel OneTBB, Catch2 and SFML