Geogram is a programming library with geometric algorithms. It has geometry-processing functionalities:
- surface reconstruction
- remeshing
- parameterization and texturing
- Intersections and Boolean operations
- Constructive Solid Geometry
It also has lower-level algorithm:
- Exact numbers / exact predicates
- Delaunay triangulations in 2D and highly efficient parallel Delaunay triangulations in 3D
- A multithread-friendly 2D constrained Delaunay triangulation, that supports intersecting constraints, in arbitrary precision.
- Memory efficient surfacic/volumetric/hybrid mesh data structure
- Efficient geometric search data structures for intersection and raytracing (AABBs, KdTrees, ...)
- Spectral mesh processing
- Linear solver on CPU and GPU
Geogram received the Symposium on Geometry Processing Software Award in 2023.
History Geogram is the result of a sustained development effort that started in Y2K (Bruno's post-doc in Stanford). It contains the main results in Geometry Processing from the former ALICE Inria project (2004-2018), that is, more than 30 research articles published in ACM SIGGRAPH, ACM Transactions on Graphics, Symposium on Geometry Processing and Eurographics, all these results maintained and reproducible, and some of them used in industrial products. Geogram was supported by two grants from the European Research Council (ERC): GOODSHAPE and VORPALINE, and two Exploratory Action grants from Inria (AeX): EXPLORAGRAM and COSMOGRAM (the latter still active), pushing the limits of Geogram to large-scale computational physics and Optimal Transport, in the frame of the PARMA Inria project.
- Documentation, how to compile, tutorials....
- Programmer's reference manuals...
- Releases
- Projects with geogram
- Graphite, an experimental 3D modeler built around geogram.
- Geogram in-browser demos (How is it possible ? more on this here)
- Data
See FAQ