Happy to share the poster on mesh generation with CGAL that we presented last week at IMR26.
It gives a comprehensive overview of the existing tools for 2D, surface, and 3D meshing in CGAL, as well as a glimpse into some on-going developments!
Happy to share the poster on mesh generation with CGAL that we presented last week at IMR26.
It gives a comprehensive overview of the existing tools for 2D, surface, and 3D meshing in CGAL, as well as a glimpse into some on-going developments!
The CGAL project has been accepted as a mentoring organization for the 2026 Google Summer of Code:
summerofcode.withgoogle.com/programs/202....
Check out our project page, github.com/CGAL/cgal/wi..., and get in touch with our mentors!
#GSoC #GSoC2026 #OpenSource
New in CGAL: Fast and robust computation of FrΓ©chet distances in any dimension.
Based on the work of Bringmann, KΓΌnnemann, and Nusser "Walking the dog fast in practice".
Full blog entry: cgal.github.io/cgal-web/202...
New in CGAL: Remeshing of planar patches.
Using this new function, you can remesh models to use as few elements as possible, with control over the geometric error.
Planarity detection is customizable: Region Growing, RANSAC Shape Detection, ...
More @ www.cgal.org/2025/05/22/S...
New in CGAL 6.1: 2D triangulations on hyperbolic surfaces.
Coming from INRIA Nancy, this new package offers a data structure and algorithms for Delaunay triangulations of closed orientable hyperbolic surfaces.
Read more at: www.cgal.org/2025/06/24/t...
The CGAL Open Source Project is pleased to announce the release 6.1 of CGAL, the Computational Geometry Algorithms Library.
3D constrained triangulations, 3D snap rounding, faster Boolean operations, FrΓ©chet distance computations, and much more
Changelog: www.cgal.org/2025/10/01/c...
Later today, CGAL will be presented at the seminar "Geometry & Visualization" @ berlin.social/@freieuniver...
Unusually, focus will be on organizational aspects of the open source project: license choice, infrastructure, sustaining a long-term project, ...
mi.fu-berlin.de/en/math/grou...
Chopping with CGAL is 10 times faster in our upcoming release, CGAL 6.1.
Re-implemented from scratch, clipping/splitting now supports non-triangular faces and can handle self-intersecting inputs.
More on the blog entry: www.cgal.org/2025/06/06/n...
The beta release for the next version of CGAL (6.1) is now available!
New:
- 3D contrained triangulations
- Isosurfacing methods
- Robust and fast self-intersection removal
- 10x faster plane clipping
- Frechet distance
- ...
Full changelog and download: www.cgal.org/2025/07/07/c...
New in CGAL: Robust and fast self-intersection removal in triangle meshes!
Combining Boolean operations and snap rounding, we remove all self-intersections consistently, for example over all of Thingi10k.
Work to be presented at SGP in Bilbao this week.
More: www.cgal.org/2025/06/13/a...
Input (left); remeshing with a budget of 50k vertices: isotropic (middle) and curvature adapted (right).
Multiple energies are available, for example to produce meshes that are uniform, or curvature adapted.
Documentation: doc.cgal.org/6.1/Polygon_...
Input (left); remeshing without (middle) and with (right) QEM-based placement optimization.
New in CGAL: A new method for surface remeshing, with sharp feature preservation.
"ACVD Remeshing" is based on publications of Valette et al., and uses clusters of vertices, which are grown to minimize a particular energy until convergence.
Blog entry: www.cgal.org/2025/05/22/S...
From time to time, users allow us to tell us how they use CGAL.
To learn why recent speed improvements for our Boolean operations are crucial for De Beers Group and Tiffany & Co., check the gallery at cgal.org
and read the press release: www.cgal.org/news/2025/04...
The CGAL project has been accepted as a mentoring organization for the 2025 Google Summer of Code
(summerofcode.withgoogle.com/programs/202...).
Check out our project page (github.com/CGAL/cgal/wi...) and get in touch with our mentors! #GSoC
Mesh generation from labeled image without weights (left, 88,000 vertices) and with weights (right, 67,000 vertices).
New in CGAL: 3D Mesh Generation receives another batch of improvements with CGAL 6.0
- Recovery of sharp features in labeled images
- Weighted labeled images are now supported
- Improved mesh quality near sharp features, for all domain types
More info: www.cgal.org/2024/12/01/m...
A binary version of Kitware's VESPA Plugin for Paraview is now available!
This plugin brings some CGAL mesh processing components to VTK and ParaView through a transparent wrapping.
Let us know if there are CGAL components you'd like to see in VESPA!
gitlab.kitware.com/vtk/meshing/...
The CGAL Open Source Project is pleased to announce the release 6.0 of CGAL, the Computational Geometry Algorithms Library.
Four new packages, 2D AABB Tree, autorefinement of triangle soups, tetrahedral remeshing with sizing fields, and more.
Changelog: www.cgal.org/2024/09/27/c...