mirror of https://github.com/CGAL/cgal
128 lines
3.2 KiB
C++
Executable File
128 lines
3.2 KiB
C++
Executable File
// ======================================================================
|
|
//
|
|
// Copyright (c) 2002 The CGAL Consortium
|
|
//
|
|
// This software and related documentation is part of an INTERNAL release
|
|
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
|
// intended for general use.
|
|
//
|
|
// ----------------------------------------------------------------------
|
|
//
|
|
// release :
|
|
// release_date :
|
|
//
|
|
// file : include/CGAL/Kd_tree_traits_point.h
|
|
// package : ASPAS
|
|
// revision : 1.4
|
|
// revision_date : 2002/16/08
|
|
// authors : Hans Tangelder (<hanst@cs.uu.nl>)
|
|
// maintainer : Hans Tangelder (<hanst@cs.uu.nl>)
|
|
// coordinator : Utrecht University
|
|
//
|
|
// ======================================================================
|
|
|
|
|
|
#ifndef CGAL_KD_TREE_TRAITS_POINT_H
|
|
#define CGAL_KD_TREE_TRAITS_POINT_H
|
|
#include <CGAL/Splitting_rules.h>
|
|
namespace CGAL {
|
|
|
|
template <class Separator_, class Item_>
|
|
class Kd_tree_traits_point {
|
|
|
|
public:
|
|
typedef Separator_ Separator;
|
|
typedef Item_ Item;
|
|
typedef Item** Item_iterator;
|
|
// CGAL dependency typedef typename Kernel_traits<Item>::Kernel K;
|
|
// CGaL dependency typedef typename K::FT NT;
|
|
typedef typename Item::R::FT NT;
|
|
typedef std::pair<Item*,NT> Item_with_distance;
|
|
|
|
private:
|
|
|
|
unsigned int the_bucket_size;
|
|
Split_rule the_selected_split_rule;
|
|
NT the_aspect_ratio;
|
|
bool use_extended_nodes_option;
|
|
|
|
public:
|
|
|
|
|
|
Kd_tree_traits_point(unsigned int bucket_size=1,
|
|
Split_rule My_split_rule=SLIDING_MIDPOINT,
|
|
NT aspect_ratio=3.0,
|
|
bool use_extended_nodes=true) {
|
|
the_bucket_size = bucket_size;
|
|
the_selected_split_rule = My_split_rule;
|
|
the_aspect_ratio = aspect_ratio;
|
|
use_extended_nodes_option = use_extended_nodes;
|
|
}
|
|
|
|
NT aspect_ratio() const {return the_aspect_ratio;}
|
|
Split_rule selected_split_rule() const {return the_selected_split_rule;}
|
|
Shrink_rule selected_shrink_rule() const {return NONE;}
|
|
unsigned int bucket_size() const {return the_bucket_size;}
|
|
bool use_extended_nodes() const {return use_extended_nodes_option;}
|
|
|
|
// split c0 in c0 and c1
|
|
Separator* split(Points_container<Item>& c0, Points_container<Item>& c1)
|
|
{
|
|
Separator* sep;
|
|
|
|
switch (the_selected_split_rule) {
|
|
|
|
case SLIDING_MIDPOINT:
|
|
{Sliding_MidPoint<Item> M;
|
|
sep=M.rule(c0);
|
|
c0.split_container(c1,sep,true);}
|
|
break;
|
|
|
|
case SLIDING_FAIR:
|
|
{Sliding_Fair<Item> M;
|
|
sep=M.rule(c0,aspect_ratio());
|
|
c0.split_container(c1,sep,true);}
|
|
break;
|
|
|
|
case FAIR:
|
|
{Fair<Item> M;
|
|
sep=M.rule(c0,aspect_ratio());
|
|
c0.split_container(c1,sep);}
|
|
break;
|
|
|
|
case MEDIAN_OF_MAX_SPREAD:
|
|
{Median_Of_Max_Spread<Item> M;
|
|
sep=M.rule(c0);
|
|
c0.split_container(c1,sep);}
|
|
break;
|
|
|
|
case MEDIAN_OF_BOX:
|
|
{Median_Of_Box<Item> M;
|
|
sep=M.rule(c0);
|
|
c0.split_container(c1,sep);}
|
|
break;
|
|
|
|
case MIDPOINT_OF_MAX_SPREAD:
|
|
{MidPoint_Of_Max_Spread<Item> M;
|
|
sep=M.rule(c0);
|
|
c0.split_container(c1,sep);}
|
|
break;
|
|
|
|
case MIDPOINT_OF_BOX:
|
|
{MidPoint_Of_Box<Item> M;
|
|
sep=M.rule(c0);
|
|
c0.split_container(c1,sep);}
|
|
break;
|
|
|
|
default:
|
|
std::cerr << "Split rule corrupted\n";
|
|
}
|
|
|
|
return sep;
|
|
}
|
|
|
|
};
|
|
|
|
} // namespace CGAL
|
|
#endif // KD_TREE_TRAITS_POINT_H
|