CGAL 4.4 - dD Spatial Searching
|
#include <CGAL/Manhattan_distance_iso_box_point.h>
The class Manhattan_distance_iso_box_point
provides an implementation of the GeneralDistance
concept for the Manhattan distance ( \( l_1\) metric) between a d
-dimensional iso-box and a d
-dimensional point and the Manhattan distance between a d
-dimensional iso-box and a d
-dimensional iso-box defined as a k-d
tree rectangle.
Parameters
Expects for the template argument a model for the concept SearchTraits
, for example Search_traits_3<Simple_cartesian<double> >
.
GeneralDistance
Types | |
typedef Traits::FT | FT |
Number type. | |
typedef Traits::Point_d | Point_d |
Point type. | |
typedef Traits::Iso_box_d | Query_item |
Query item type. | |
Creation | |
Manhattan_distance_iso_box_point (Traits t=Traits()) | |
Default constructor. | |
Operations | |
FT | transformed_distance (Query_item b, Point_d p) const |
Returns the transformed distance between b and p . | |
FT | transformed_distance (FT d) const |
Returns the transformed value of of d . | |
FT | inverse_of_transformed_distance (FT d) const |
Returns the value of the inverse of the transform function applied to d . | |
FT | min_distance_to_rectangle (Query_item b, Kd_tree_rectangle< FT > r) const |
Returns the minimal distance between a point from b and a point from r . | |
FT | max_distance_to_rectangle (Query_item b, Kd_tree_rectangle< FT > r) const |
Returns the maximal distance between the iso-box b and a point from r furthest to b . | |