mirror of https://github.com/CGAL/cgal
39 lines
1.2 KiB
Plaintext
39 lines
1.2 KiB
Plaintext
/// \defgroup PkgSpatialSearchingD dD Spatial Searching
|
|
|
|
/// \defgroup PkgSpatialSearchingDConcepts Concepts
|
|
/// \ingroup PkgSpatialSearchingD
|
|
|
|
/// \defgroup SearchClasses Search Classes
|
|
/// \ingroup PkgSpatialSearchingD
|
|
|
|
/// \defgroup RangeQueryItemClasses Range Query Item Classes
|
|
/// \ingroup PkgSpatialSearchingD
|
|
|
|
/// \defgroup SearchTraitsClasses Search Traits Classes
|
|
/// \ingroup PkgSpatialSearchingD
|
|
|
|
/// \defgroup DistanceClasses Distance Classes
|
|
/// \ingroup PkgSpatialSearchingD
|
|
|
|
/// \defgroup SplitterClasses Splitter Classes
|
|
/// \ingroup PkgSpatialSearchingD
|
|
|
|
/// \defgroup AdvancedClasses Advanced Classes
|
|
/// \ingroup PkgSpatialSearchingD
|
|
|
|
|
|
|
|
/*!
|
|
\addtogroup PkgSpatialSearchingD
|
|
\todo check generated documentation
|
|
\PkgDescriptionBegin{dD Spatial Searching}
|
|
\PkgPicture{windowQuery.png}
|
|
\PkgAuthor{Hans Tangelder and Andreas Fabri}
|
|
\PkgDesc{This package implements exact and approximate distance browsing by providing exact and approximate algorithms for range searching, k-nearest and k-furthest neighbor searching, as well as incremental nearest and incremental furthest neighbor searching, where the query items are points in dD Euclidean space.}
|
|
\PkgSince{3.0}
|
|
\cgalbib{cgal:tf-ssd}
|
|
\license{ \ref licensesGPL "GPL" }
|
|
\PkgDescriptionEnd
|
|
*/
|
|
|