diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt b/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
index 99bfd18b5f0..0bce00abaa6 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
@@ -6,7 +6,7 @@
 /*!
 \addtogroup PkgSurfaceMeshTopology
 \cgalPkgDescriptionBegin{Surface Mesh Topology,PkgSurfaceMeshTopologySummary}
-\cgalPkgPicture{sm_topology_logo.svg}
+\cgalPkgPicture{surface-mesh-topology-logo.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Guillaume Damiand, Francis Lazarus}
 \cgalPkgDesc{This package provides methods for testing if two (closed) paths on a combinatorial surface are homotopic. The user can choose between free homotopy and homotopy with fixed endpoints. The algorithms are based on a paper by Erickson and Whittlesey \cgalCite{ew-tcsr-13}. If the input surface has size \f$n\f$, the construction of a `Surface_mesh_curve_topology` takes \f$O(n)\f$ time. The homotopy tests are then linear in the size of the input curves.}
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/fig/surface-mesh-topology-logo.png b/Surface_mesh_topology/doc/Surface_mesh_topology/fig/surface-mesh-topology-logo.png
new file mode 100644
index 00000000000..1c704fb7d71
Binary files /dev/null and b/Surface_mesh_topology/doc/Surface_mesh_topology/fig/surface-mesh-topology-logo.png differ
diff --git a/Surface_mesh_topology/package_info/Surface_mesh_topology/long_description.txt b/Surface_mesh_topology/package_info/Surface_mesh_topology/long_description.txt
index e86b6c7d4d8..181ab9c6032 100644
--- a/Surface_mesh_topology/package_info/Surface_mesh_topology/long_description.txt
+++ b/Surface_mesh_topology/package_info/Surface_mesh_topology/long_description.txt
@@ -1,3 +1 @@
-Implementation of topological algorithms on surface meshes.
-
-TODO: an abstract. 
+Given two walks in the vertex-edge graph of a combinatorial map, this package provides linear time algorithms to decide if the walks are homotopic, i.e. can be continuously deformed one into the other on the surface of the combinatorial map. Two notions of homotopy are proposed. Homotopy with fixed basepoints applies to non necessarily closed walks and assumes that the common endpoints of the walks stay fix during the deformation. Free homotopy applies only to closed walks and does not impose any restriction on the deformation. Another helpful algorithm is provided to test if a single curve is contractible; it is equivalent to a homotopy test where one of the closed walks is reduced to a  point.