Geogram: a library for geometric algorithms

We present a set of geometric algorithms for grid generation. Tehe implementation of the algorithms is available in the public GEOGRAM [1] library (BSD Open-Source License). The sey of algorithm comprises: ·Robust geometric predicates, using adaptative precision floating point arithmetics simulation of simplicity to handle the corner cases, and arithmetic filters to carly detect and quicly handle the easy cases; ·Geometric search data structures, including Kd-Tress (for ncarest neighbors queries) and Axis-Aligned BBox Trees (for mesh intersection); ·Delaunay triangulation and power diagrams in 3d; ·Restricted Vorono Diagram in arbitrary dimension. The design of the library follows a minimalistic principle, combined with the algorithmic state of the art, inspired by. Compared with CGAL, our impementation is significantly more memory efficient, sometimes faster, much casier to understand (no generic programming), at the cost of being less generic/dynamic. All the algorithms are parallized using an abstract model taht suports pthreads, OpenMP and Windows theads. In addition, the library has no dependancy and is easy to compile on any platform that has IEEE754 floating point arithmetics (Linux, Mac, Windows, Android, ...). The library was used to implement a solver for Optimal Transport