mirror of https://github.com/CGAL/cgal
small doc update
This commit is contained in:
parent
20e3cb8462
commit
c580e30407
|
|
@ -42,7 +42,7 @@ public:
|
||||||
using Construct_root_node_contents = unspecified_type;
|
using Construct_root_node_contents = unspecified_type;
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
* \brief functor which fills the contents of the nodes children.
|
* \brief Functor which fills the contents of the nodes children.
|
||||||
*
|
*
|
||||||
* Provides the operator:
|
* Provides the operator:
|
||||||
* `void operator()(typename Tree::Node_index, Tree&, const Point_d&)`
|
* `void operator()(typename Tree::Node_index, Tree&, const Point_d&)`
|
||||||
|
|
|
||||||
|
|
@ -724,7 +724,7 @@ public:
|
||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
\brief determines whether the node specified by index `n` is a root node.
|
\brief determines whether the node specified by index `n` is the root node.
|
||||||
*/
|
*/
|
||||||
bool is_root(Node_index n) const {
|
bool is_root(Node_index n) const {
|
||||||
return n == 0;
|
return n == 0;
|
||||||
|
|
|
||||||
|
|
@ -119,7 +119,7 @@ namespace Orthtrees {
|
||||||
\ingroup PkgOrthtreeNeighbors
|
\ingroup PkgOrthtreeNeighbors
|
||||||
\brief finds at most `k` elements within a specific radius that are
|
\brief finds at most `k` elements within a specific radius that are
|
||||||
nearest to the center of the sphere `query`: if `query` does not contain
|
nearest to the center of the sphere `query`: if `query` does not contain
|
||||||
at least `k` elements, only contained points will be returned.
|
at least `k` elements, only contained elements will be returned.
|
||||||
|
|
||||||
This function is useful when the user already knows how sparse the elements are,
|
This function is useful when the user already knows how sparse the elements are,
|
||||||
or if they do not care about elements that are too far away.
|
or if they do not care about elements that are too far away.
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue