summaryrefslogtreecommitdiff
path: root/src/Spatial_searching/include
diff options
context:
space:
mode:
Diffstat (limited to 'src/Spatial_searching/include')
-rw-r--r--src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h4
1 files changed, 3 insertions, 1 deletions
diff --git a/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h b/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h
index 016975b8..ca05af57 100644
--- a/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h
+++ b/src/Spatial_searching/include/gudhi/Spatial_tree_data_structure.h
@@ -54,7 +54,9 @@ namespace spatial_searching {
* and the <i>incremental nearest neighbor query</i>, where no number of neighbors is provided during the call, as the
* neighbors will be computed incrementally when the iterator on the range is incremented.
*
- * \tparam K requires a <a target="_blank"
+ * \tparam K requires a model of the <a target="_blank"
+ * href="http://doc.cgal.org/latest/Spatial_searching/classSearchTraits.html">SearchTraits</a>
+ * concept, such as the <a target="_blank"
* href="http://doc.cgal.org/latest/Kernel_d/classCGAL_1_1Epick__d.html">CGAL::Epick_d</a> class, which
* can be static if you know the ambiant dimension at compile-time, or dynamic if you don't.
* \tparam Point_container_ is the type of the container where points are stored (on the user side).