CGAL 6.1.2 - dD Spatial Searching: Spatial_searching/weighted_Minkowski_distance.cpp

CGAL 6.1.2 - dD Spatial Searching

Loading...
Searching...
No Matches
Spatial_searching/weighted_Minkowski_distance.cpp
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Orthogonal_k_neighbor_search.h>
#include <CGAL/Weighted_Minkowski_distance.h>
#include <CGAL/Search_traits_2.h>
#include <CGAL/point_generators_2.h>
typedef CGAL::Simple_cartesian<double> K;
typedef K::Point_2 Point_d;
typedef CGAL::Random_points_in_square_2<Point_d> Random_points_iterator;
typedef CGAL::Counting_iterator<Random_points_iterator> N_Random_points_iterator;
typedef CGAL::Search_traits_2<K> TreeTraits;
typedef CGAL::Weighted_Minkowski_distance<TreeTraits> Distance;
typedef CGAL::Orthogonal_k_neighbor_search<TreeTraits, Distance> K_neighbor_search;
typedef K_neighbor_search::Tree Tree;
int main()
{
const int D = 2;
const int N = 1000;
const unsigned int K = 5;
Random_points_iterator rpit( 1.0);
Tree tree(N_Random_points_iterator(rpit,0),
N_Random_points_iterator(N));
Point_d query(0,0);
double w[2] = { 1.0, 2.0};
Distance tr_dist(3.14,D,w, w+D);
K_neighbor_search search(tree, query, K, 0.0, true, tr_dist);
for (K_neighbor_search::iterator it = search.begin(); it!=search.end(); ++it)
std::cout << "Point " << (*it).first << " at distance = " << (*it).second << std::endl;
return 0;
}
CGAL::Counting_iterator
CGAL::Orthogonal_k_neighbor_search
The class Orthogonal_k_neighbor_search implements approximatek-nearest and k-furthest neighbor search...
Definition: Orthogonal_k_neighbor_search.h:31
CGAL::Random_points_in_square_2
CGAL::Search_traits_2
The class Search_traits_2 can be used as a template parameter of the kd tree and the search classes.
Definition: Search_traits_2.h:19
CGAL::Weighted_Minkowski_distance
The class Weighted_Minkowski_distance provides an implementation of the concept OrthogonalDistance,...
Definition: Weighted_Minkowski_distance.h:26
CGAL::Simple_cartesian