From 9004fc92b2db1cf793374be0f4842c871786d623 Mon Sep 17 00:00:00 2001 From: cjamin Date: Tue, 4 Oct 2016 13:26:32 +0000 Subject: Recommend the user to read CGAL doc git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/subsampling_and_spatialsearching@1619 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: a4c42c45551039c634b60cc9fa21b12bb4c907ba --- src/Spatial_searching/doc/Intro_spatial_searching.h | 4 ++++ 1 file changed, 4 insertions(+) (limited to 'src/Spatial_searching/doc') diff --git a/src/Spatial_searching/doc/Intro_spatial_searching.h b/src/Spatial_searching/doc/Intro_spatial_searching.h index 2406c931..23705378 100644 --- a/src/Spatial_searching/doc/Intro_spatial_searching.h +++ b/src/Spatial_searching/doc/Intro_spatial_searching.h @@ -39,6 +39,10 @@ namespace spatial_searching { * CGAL dD spatial searching algorithms. * It provides a simplified API to perform (approximate) neighbor searches. Contrary to CGAL default behavior, the tree * does not store the points themselves, but stores indices. + * + * For more details about the data structure or the algorithms, or for more advanced usages, reading + * CGAL documentation + * is highly recommended. * * \section spatial_searching_examples Example * -- cgit v1.2.3