CGAL is a software project that provides easy access to efficient and reliable geometric algorithms in the form of a C++ library.
worldwide
Joined March 2011
- Tweets166
- Following0
- Followers504
- Likes411
Pinned Tweet
The CGAL Open Source Project is pleased to announce the release 6.2 of CGAL, the Computational Geometry Algorithms Library.
2D Alpha Wrapping, 3D barycentric coordinates, new mesh kernel implementation, fast convex hull intersection, and more!
Changelog: cgal.org/2026/06/11/cgal62/
CGAL retweeted
VESPA 1.0 is now available!
VESPA brings CGAL geometry processing algorithms into VTK and ParaView workflows, including:
• Poisson surface reconstruction
• Signed distance function generation
• Mesh deformation
• Alpha wrapping
Read more: ow.ly/30kZ50Z4aNI
#Vespa #VTK #ParaView
CGAL retweeted
🧭Calcul géométrique 2D/3D : maîtrisez CGAL
📆29 avril, découvrez CGAL, la bibliothèque #OpenSource d’algorithmes géométriques utilisée pr la modélisation 3D, les maillages ou l’infographie
👥Pour ingénieurs R&D & développeurs C++
👉inria-academy.fr/formation/c…
#deeptech #training
New in CGAL: a 2D version for Alpha Wrapping.
Generate robust, watertight polygons (with holes) from any input. Unconditionally robust to input defects.
Coming in CGAL 6.2 (Summer 2026)!
Read more at cgal.org/2026/03/30/alpha_wr…
New in CGAL: restructuring of the "Polygon Mesh Processing" package.
The 200+ documented functions for geometry processing on polygonal meshes have been re-organized into four distinct packages to improve usability.
Part of CGAL 6.2, preview here: doc.cgal.org/6.2/Manual/pack…
CGAL retweeted
🔬 Calcul géométrique 2D/3D : maîtrisez CGAL
Le 29 avril, découvrez CGAL, la bibliothèque #OpenSource d’algorithmes géométriques utilisée pr la modélisation 3D, les maillages ou l’infographie
🎯 Pour ingénieurs R&D & développeurs C++
👉 inria-academy.fr/formation/c… #deeptech #training
The CGAL project has been accepted as a mentoring organization for the 2026 Google Summer of Code:
summerofcode.withgoogle.com/….
Check out our project page, github.com/CGAL/cgal/wiki/Pr…, 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.org/2025/12/31/Frechet_…
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 @ cgal.org/2025/05/22/Surface_…
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.
More: cgal.org/2025/06/24/triangul…
The CGAL Open Source Project is pleased to announce the release 6.1 of CGAL, the Computational Geometry Algorithms Library.
3D constrained triangulations, faster Boolean operations, 3D snap rounding, Fréchet distance computation, and much more!
Changelog:cgal.org/2025/10/01/cgal61/
CGAL retweeted
My latest creation with Geotoy, built using the alpha wrap function from the CGAL library
I've been getting a ton of value out of this; it's really useful for creating organic-looking structures
You can see it in 3D here: 3d.ameo.design/geotoy/edit/6…
(takes ~30 seconds to run)
ALT A screenshot of a 3D model created and rendered with Geotoy. It depicts a multi-layered folded shell enclosed in a spherical area, textured and shaded to look somewhat copper-colored. The surface appears rather shiny and metallic with colors ranging from orange/brown to pink, peach, and crimson. It consists of several separate thin layers of material that warp and curl in roughly the same way as each other, yielding an organic look reminiscent of a smooth endoplasmic reticulum.
Later today, CGAL will be presented at the seminar "Geometry & Visualization" @FU_Berlin
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…
Slides to follow!
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: cgal.org/2025/06/06/new_clip…
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: cgal.org/2025/07/07/cgal61-b…
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 this week.
More: cgal.org/2025/06/13/autorefi…
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: cgal.org/2025/05/22/Surface_…
ALT Input (left); remeshing without (middle) and with (right) QEM-based placement optimization.
Multiple energies are available, for example to produce meshes that are uniform, or curvature adapted.
Documentation: doc.cgal.org/6.1/Polygon_mes…
ALT Input (left); remeshing with a budget of 50k vertices: isotropic (middle) and curvature adapted (right).