mirror of https://github.com/CGAL/cgal
37 lines
1.4 KiB
Plaintext
37 lines
1.4 KiB
Plaintext
/// \defgroup PkgRangeSegmentTreesD dD Range and Segment Trees Reference
|
|
/// \defgroup PkgRangeSegmentTreesDConcepts Concepts
|
|
/// \ingroup PkgRangeSegmentTreesD
|
|
|
|
/// \defgroup PkgRangeSegmentTreesDTraitsClasses Traits Classes
|
|
/// \ingroup PkgRangeSegmentTreesD
|
|
|
|
/// \defgroup PkgRangeSegmentTreesDSearchStructure Search Structures
|
|
/// \ingroup PkgRangeSegmentTreesD
|
|
|
|
/*!
|
|
\addtogroup PkgRangeSegmentTreesD
|
|
\todo check generated documentation
|
|
\PkgDescriptionBegin{dD Range and Segment Trees,PkgRangeSegmentTreesDSummary}
|
|
\PkgPicture{segment_tree.png}
|
|
\PkgSummaryBegin
|
|
\PkgAuthor{Gabriele Neyer}
|
|
\PkgDesc{Range and segment trees allow to perform window queries on point sets, and to enumerate all ranges enclosing a query point. The provided data structures are static and they are optimized for fast queries.}
|
|
\PkgManuals{Chapter_dD_Range_and_Segment_Trees,PkgRangeSegmentTreesD}
|
|
\PkgSummaryEnd
|
|
\PkgShortInfoBegin
|
|
\PkgSince{0.9}
|
|
\PkgBib{cgal:n-rstd}
|
|
\PkgLicense{\ref licensesGPL "GPL"}
|
|
\PkgShortInfoEnd
|
|
\PkgDescriptionEnd
|
|
|
|
This chapter presents the \cgal range tree and segment tree data structures.
|
|
|
|
The range tree is theoretically superior to the \f$ Kd\f$-tree, but the
|
|
latter often seems to perform better.
|
|
However, the range tree as implemented in \cgal is more flexible than the
|
|
\f$ Kd\f$-tree implementation, in that it enables to layer together range trees
|
|
and segment trees in the same data structure.
|
|
*/
|
|
|