CGAL 4.4 - dD Spatial Searching
•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Euclidean_distance< Traits > Class Template Reference
Distance Classes

#include <CGAL/Euclidean_distance.h>

Definition

The class Euclidean_distance provides an implementation of the concept OrthogonalDistance, with the Euclidean distance ( l2 metric).

To optimize distance computations squared distances are used.

Parameters

Expects for the first template argument a model of the concept SearchTraits, for example Search_traits_2<Simple_cartesian<double> >.

Is Model Of:
OrthogonalDistance
See Also
OrthogonalDistance
CGAL::Weighted_Minkowski_distance<Traits>
Examples:
Spatial_searching/using_fair_splitting_rule.cpp.

Types

typedef Traits::FT FT
 Number type.
 
typedef Traits::Point_d Point_d
 Point type.
 
typedef Point_d Query_item
 Query item type.
 

Creation

 Euclidean_distance (Traits t=Traits())
 Default constructor.
 

Operations

FT transformed_distance (Query_item q, Point_d p) const
 Returns the squared Euclidean distance between q and p.
 
FT min_distance_to_rectangle (Query_item q, Kd_tree_rectangle< FT > r) const
 Returns the squared Euclidean distance between q and the point on the boundary of r closest to q.
 
FT max_distance_to_rectangle (Query_item q, Kd_tree_rectangle< FT > r;) const
 Returns the squared Euclidean distance, where d denotes the distance between q and the point on the boundary of r farthest to q.
 
FT new_distance (FT dist, FT old_off, FT new_off, int cutting_dimension) const
 Updates the squared dist incrementally and returns the updated squared distance.
 
FT transformed_distance (FT d) const
 Returns d2.
 
FT inverse_of_transformed_distance (FT d) const
 Returns d1/2.