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: https://t.co/QOl4aN189T
@natsu_water You should be able to use CGAL::create_offset_polygons_2() and the weighted skeleton, or the functions CGAL::create_interior_weighted_skeleton_and_offset_polygons_with_holes_2() / CGAL::create_exterior_weighted_skeleton_and_offset_polygons_with_holes_2().
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 https://t.co/3VrXJkbOjj
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: https://t.co/vcMtq7yDPl
🔬 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++
👉 https://t.co/xj5ie4Iv5V #deeptech#training
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:
https://t.co/HE5D5D2uXE.
Check out our project page, https://t.co/0R1QKr20cO, 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: https://t.co/WTup8gvmgK
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 @ https://t.co/JFbkkfRdr2
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: https://t.co/wuwgN1VGdp
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:https://t.co/fTEIIBLtuR
@Ameobea10 Hi, did you try do define CGAL_ALWAYS_ROUND_TO_NEAREST ? That way there is no rounding mode change to emulate. Intervals will be a bit larger but nothing dramatic on the performance.
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: https://t.co/5PaIKJGVfs
(takes ~30 seconds to run)
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, ...
https://t.co/44JDT7cmDF
Slides to follow!