#include <CGAL/Kd_tree_rectangle.h>
The class Kd_tree_rectangle implements d-dimensional iso-rectangles and related operations, e.g., methods to compute bounding boxes of point sets.
- Examples:
- Spatial_searching/Distance.h.
|
(Note that these are not member functions.)
|
| template<class FT > |
| std::ostream & | operator<< (std::ostream &s, Kd_tree_rectangle< FT > &r) |
| | Inserts rectangle r in the output stream s and returns s. More...
|
| |
|
| | Kd_tree_rectangle (int d) |
| | Constructs a d-dimensional rectangle r with lower bound and upper bound set to zero in each dimension. More...
|
| |
| template<class Construct_cartesian_const_iterator_d , class PointIter > |
| | Kd_tree_rectangle (int d, PointIter begin, PointIter end, const Construct_cartesian_const_iterator_d &construct_it) |
| | Constructs the bounding box of the points in the range [begin,end), where the value type of PointIter can be used by operators of functors Construct_cartesian_const_iterator_d to define iterators with value type FT. More...
|
| |
Constructs a d-dimensional rectangle r with lower bound and upper bound set to zero in each dimension.
template<typename FT>
template<class Construct_cartesian_const_iterator_d , class PointIter >
Constructs the bounding box of the points in the range [begin,end), where the value type of PointIter can be used by operators of functors Construct_cartesian_const_iterator_d to define iterators with value type FT.
Returns the dimension of the rectangle.
Returns the upper bound of the rectangle in dimension i.
Returns the maximal span of the rectangle.
Returns the smallest coordinate for which the rectangle has its maximal span.
Returns the lower bound of the rectangle in dimension i.
Sets lower bound in dimension i to x.
Sets upper bound in dimension i to x.
Splits rectangle in dimension d at coordinate-value value by modifying itself to lower half and by modifying r to upper half.
Inserts rectangle r in the output stream s and returns s.