The public CGAL repository, see the README below
OTHER License
Bot releases are visible (Hide)
Published by lrineau over 3 years ago
CGAL-5.2.3 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.2.2.
Published by lrineau over 3 years ago
CGAL-5.1.5 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.1.4.
Published by lrineau over 3 years ago
The CGAL Open Source Project is pleased to announce the release 5.3 Beta 1 of CGAL, the Computational Geometry Algorithms Library.
CGAL version 5.3 Beta 1 is a public testing release. It should provide a solid ground to report bugs that need to be tackled before the release of the final version of CGAL 5.3 in July 2021.
Besides fixes and general enhancement to existing packages, the following has changed since CGAL 5.2:
A comprehensive list of the supported file formats is available in the Stream_support package here; inversely, the following page can be used to find out which CGAL data structures can be used given a specific file format.
3.14
.is_translation()
, is_scaling()
, is_reflection()
, and is_rotation()
to the classesAff_transformation_2
Aff_transformation_3
,oriented_side(const Point_2& p, ....)
CGAL::Polyhedral_envelope
,CGAL::Surface_mesh_topology::Curves_on_surface_topology::is_homotopic_to_simple_cycle()
,Polyhedral_envelope_filter
,insert_if_in_star()
CGAL::Regular_triangulation
,p
in a regular triangulation on the condition that p
Alpha_shape_euclidean_traits_2
,Weighted_alpha_shape_euclidean_traits_2
, Alpha_shape_euclidean_traits_3
, andWeighted_alpha_shape_euclidean_traits_3
. All CGAL kernel can be used directly as modelsCGAL::TensorFlow::Neural_network_classifier
has been removed.Published by lrineau over 3 years ago
CGAL-5.2.2 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.2.1.
Published by lrineau over 3 years ago
CGAL-5.1.4 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.1.3.
Published by lrineau over 3 years ago
CGAL-5.2.1 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.2.
Published by lrineau over 3 years ago
CGAL-5.1.3 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.1.2.
Published by lrineau almost 4 years ago
The CGAL Open Source Project is pleased to announce the release 5.2 of CGAL, the Computational Geometry Algorithms Library.
Fixes, improvements, and various small features have been added since CGAL 5.1. See https://www.cgal.org/2020/12/22/cgal52/ for a complete list of changes.
Published by lrineau almost 4 years ago
CGAL-5.1.2 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.1.1.
Published by lrineau almost 4 years ago
The CGAL Open Source Project is pleased to announce the release 5.2 Beta 1 of CGAL, the Computational Geometry Algorithms Library.
CGAL version 5.2 Beta 1 is a public testing release. It should provide a solid ground to report bugs that need to be tackled before the release of the final version of CGAL 5.2 in December 2020.
Fixes, improvements, and various small features have been added since CGAL 5.1. See https://www.cgal.org/2020/11/18/cgal52-beta1/ for a complete list of changes.
Published by lrineau almost 4 years ago
CGAL-5.1.1 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.1.
Published by lrineau almost 4 years ago
CGAL-5.0.4 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.0.3.
Published by lrineau about 4 years ago
The CGAL Open Source Project is pleased to announce the release 5.1 of CGAL, the Computational Geometry Algorithms Library.
Besides fixes and general enhancement to existing packages, the following has changed since CGAL 5.0:
This package implements a tetrahedral isotropic remeshing algorithm,
that improves the quality of tetrahedra in terms of dihedral angles,
while targeting a given edge length.
See also the associated blog entry.
This package enables the computation of some topological invariants of surfaces, such as:
See also the associated blog entry.
This package implements an optimization algorithm that aims to construct a close approximation
of the optimal bounding box of a mesh or a point set, which is defined as the smallest
(in terms of volume) bounding box that contains a given mesh or point set.
See also the associated blog entry.
Boost.Thread
, even if the g++ compiler is used.Two new, detailed tutorials have been added:
Both tutorials provide complete code.
CGAL::Kd_tree::build()
is given an optional template parameter ConcurrencyTag
(default value remains CGAL::Sequential_tag
for backward compatibility).CGAL::box_intersection_d()
and CGAL::box_self_intersection_d()
.CGAL::Polygon_mesh_processing::split()
, which can be used to split meshes along a mesh or a plane.CGAL::Polygon_mesh_processing::split_connected_components()
to split a single mesh containing several connected components into several meshes containing one connected component.CGAL::Polygon_mesh_processing::does_self_intersect()
and CGAL::Polygon_mesh_processing::self_intersections()
.CGAL::AABB_tree::do_not_accelerate_distance_queries()
CGAL::AABB_tree::accelerate_distance_queries()
.CGAL::AABB_tree::accelerate_distance_queries()
CGAL::AABB_tree::do_not_accelerate_distance_queries()
const
functions.CGAL::alpha_expansion_graphcut()
, which regularizes a multi-label partition over a user-defined graph.CGAL::regularize_face_selection_borders()
, which uses this alpha expansion graphcut to regularize the borders of a selected faces on a triangle mesh.See https://www.cgal.org/2020/09/08/cgal51/ for a complete list of changes.
Published by lrineau about 4 years ago
CGAL-5.0.3 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.0.2.
Published by lrineau about 4 years ago
The CGAL Open Source Project is pleased to announce the release 5.1 Beta 2 of CGAL, the Computational Geometry Algorithms Library.
CGAL version 5.1 Beta 2 is a public testing release. It should provide a solid ground to report bugs that need to be tackled before the release of the final version of CGAL 5.1 in September.
Besides fixes and general enhancement to existing packages, the following has changed since CGAL 5.0:
This package enables the computation of some topological invariants of surfaces, such as:
See also the associated blog entry.
This package implements an optimization algorithm that aims to construct a close approximation
of the optimal bounding box of a mesh or a point set, which is defined as the smallest
(in terms of volume) bounding box that contains a given mesh or point set.
See also the associated blog entry.
Boost.Thread
, even if the g++ compiler is used.Two new, detailed tutorials have been added:
Both tutorials provide complete code.
CGAL::Kd_tree::build()
is given an optional template parameter ConcurrencyTag
(default value remains CGAL::Sequential_tag
for backward compatibility).CGAL::box_intersection_d()
and CGAL::box_self_intersection_d()
.CGAL::Polygon_mesh_processing::split()
, which can be used to split meshes along a mesh or a plane.CGAL::Polygon_mesh_processing::split_connected_components()
to split a single mesh containing several connected components into several meshes containing one connected component.CGAL::Polygon_mesh_processing::does_self_intersect()
and CGAL::Polygon_mesh_processing::self_intersections()
.CGAL::AABB_tree::do_not_accelerate_distance_queries()
CGAL::AABB_tree::accelerate_distance_queries()
.CGAL::AABB_tree::accelerate_distance_queries()
CGAL::AABB_tree::do_not_accelerate_distance_queries()
const
functions.CGAL::alpha_expansion_graphcut()
, which regularizes a multi-label partition over a user-defined graph.CGAL::regularize_face_selection_borders()
, which uses this alpha expansion graphcut to regularize the borders of a selected faces on a triangle mesh.See https://www.cgal.org/2020/07/28/cgal51-beta2/ for a complete list of changes.
Published by lrineau over 4 years ago
The CGAL Open Source Project is pleased to announce the release 5.1 Beta 1 of CGAL, the Computational Geometry Algorithms Library.
CGAL version 5.1 Beta 1 is a public testing release. It should provide a solid ground to report bugs that need to be tackled before the release of the final version of CGAL 5.1 in July.
Besides fixes and general enhancement to existing packages, the following has changed since CGAL 5.0:
This package enables the computation of some topological invariants of surfaces, such as:
See also the associated blog entry.
This package implements an optimization algorithm that aims to construct a close approximation
of the optimal bounding box of a mesh or a point set, which is defined as the smallest
(in terms of volume) bounding box that contains a given mesh or point set.
See also the associated blog entry.
Two new, detailed tutorials have been added:
Both tutorials provide complete code.
CGAL::Kd_tree::build()
is given an optional template parameter ConcurrencyTag
(default value remains CGAL::Sequential_tag
for backward compatibility).CGAL::box_intersection_d()
and CGAL::box_self_intersection_d()
.CGAL::Polygon_mesh_processing::split()
, which can be used to split meshes along a mesh or a plane.CGAL::Polygon_mesh_processing::split_connected_components()
to split a single mesh containing several connected components into several meshes containing one connected component.CGAL::Polygon_mesh_processing::does_self_intersect()
and CGAL::Polygon_mesh_processing::self_intersections()
.CGAL::AABB_tree::do_not_accelerate_distance_queries()
CGAL::AABB_tree::accelerate_distance_queries()
.CGAL::AABB_tree::accelerate_distance_queries()
CGAL::AABB_tree::do_not_accelerate_distance_queries()
const
functions.CGAL::alpha_expansion_graphcut()
, which regularizes a multi-label partition over a user-defined graph.CGAL::regularize_face_selection_borders()
, which uses this alpha expansion graphcut to regularize the borders of a selected faces on a triangle mesh.See https://www.cgal.org/2020/06/09/cgal51-beta1 for a complete list of changes.
Published by lrineau over 4 years ago
CGAL-5.0.2 is a bug-fix release.
See on Github the list of bugs that were solved since CGAL-5.0.1.
Published by lrineau over 4 years ago
CGAL-4.14.3 is a bug-fix release. In particular, it fixes a performance regression in the 3D Triangulations, when the Parallel_tag
is used.
See on Github the list of bugs that were solved since CGAL-4.14.2.
Published by lrineau over 4 years ago
CGAL-5.0.1 is a bug-fix release. In particular, it fixes a performance regression in the 3D Triangulations, when the Parallel_tag
is used.
See on Github the list of bugs that were solved since CGAL-5.0.1.
Published by lrineau almost 5 years ago
The CGAL Open Source Project is pleased to announce the release 5.0
of CGAL, the Computational Geometry Algorithms Library.
Besides fixes and general enhancement to existing packages, the
following has changed since CGAL 4.14.2:
ShapeDetectionTraits
has been renamed to EfficientRANSACTraits
.Shape_detection_3
namespace has been renamed to Shape_detection
.FaceGraph
concept. Learn more about this new algorithm with this blog entry.Epeck_d
, is now available.Breaking change: Several deprecated functions and classes have been
removed. See the full list of breaking changes in the release
notes.
Breaking change: The constructor and the insert()
function of
CGAL::Triangulation_2
or CGAL::Triangulation_3
which take a range
of points as argument are now guaranteed to insert the points
following the order of InputIterator
. Note that this change only
affects the base class CGAL::Triangulation_[23]
and not any
derived class, such as CGAL::Delaunay_triangulation_[23]
.
CGAL::Polygon_mesh_processing::locate(Point, Mesh)
.smooth_mesh()
,smooth_shape()
,See https://www.cgal.org/2019/11/08/cgal50/ for a complete list of changes.