diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/PackageDescription.txt b/Alpha_wrap_3/doc/Alpha_wrap_3/PackageDescription.txt
index 59ef5b0ad53..d5f023fd6d0 100644
--- a/Alpha_wrap_3/doc/Alpha_wrap_3/PackageDescription.txt
+++ b/Alpha_wrap_3/doc/Alpha_wrap_3/PackageDescription.txt
@@ -16,7 +16,7 @@
 \cgalPkgDesc{This component takes a 3D triangle mesh, a triangle soup, or a point set as input, and generates
              a valid triangulated surface mesh that strictly contains the input (watertight, intersection-free
              and 2-manifold). The algorithm proceeds by shrink-wrapping
-             and refining a 3D Delaunay triangulation loosely bounding the input.
+             and refining a 3D Delaunay triangulation starting from a loose bounding box of the input.
              Two user-defined parameters, alpha and offset, offer control over the maximum size
              of cavities where the shrink-wrapping process can enter, and the tightness
              of the final surface mesh to the input, respectively. Once combined, these parameters
diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/alpha_wrap_3.txt b/Alpha_wrap_3/doc/Alpha_wrap_3/alpha_wrap_3.txt
index 3f0b1782297..944bcb38c03 100644
--- a/Alpha_wrap_3/doc/Alpha_wrap_3/alpha_wrap_3.txt
+++ b/Alpha_wrap_3/doc/Alpha_wrap_3/alpha_wrap_3.txt
@@ -40,7 +40,7 @@ We seek unconditional robustness in the sense that the output mesh should be val
 2-manifold, and without self-intersections), even for raw input with many defects
 and degeneracies.
 The default input is a soup of 3D triangles, but the generic interface leaves the door open
-to other types of finite 3D primitives.
+to other types of finite 3D primitives such as triangle soups and point sets.
 
 \cgalFigureAnchor{1}
 <center>
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 8a9d67a73bd..677f7794653 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -7,6 +7,18 @@ Release History
 
 Release date: June 2022
 
+### 3D Alpha Wrapping (new package)
+
+-   This component takes a 3D triangle mesh, soup, or point set as input, and generates a valid
+    (watertight, intersection-free, and combinatorially 2-manifold) surface triangle mesh
+    that contains the input.
+    The algorithm proceeds by shrink-wrapping and refining a 3D Delaunay triangulation,
+    starting from a loose bounding box of the input.
+    Two user-defined parameters, alpha and offset, offer control over the maximum size of cavities
+    where the shrink-wrapping process can enter, and the tightness of the final surface mesh
+    to the input, respectively. Once combined, these parameters provide a means to trade fidelity
+    to the input for complexity of the output.
+
 ### [dD Spatial Searching](https://doc.cgal.org/5.5/Manual/packages.html#PkgSpatialSearchingD)
 
 -   Added the member function `write_graphviz()` to the class The Kd_tree` that writes the tree in a stream in the [Graphviz](https://graphviz.org/) format.