kdtree.h File Reference
#include <vector>
#include <set>
#include <cstdlib>
#include "portage/support/portage.h"
#include "portage/search/BoundBox.h"
#include "wonton/support/Point.h"
Go to the source code of this file.
Classes | |
struct | Portage::KDTree< D > |
An N-dimensional k-d tree for manipulating polygon data. More... | |
Namespaces | |
Portage | |
Macros | |
#define | SWAP(a, b, type) |
Functions | |
template<int D> | |
KDTree< D > * | Portage::KDTreeCreate (const std::vector< IsotheticBBox< D > > &bbox) |
template<int D> | |
void | Portage::MedianSelect (int, int, double *, int *, int) |
template<int D> | |
void | Portage::LocatePoint (const Point< D > &qp, const KDTree< D > *kdtree, std::vector< int > &pfound) |
template<int D> | |
void | Portage::Intersect (const IsotheticBBox< D > &box, const KDTree< D > *kdtree, std::vector< int > &pfound) |
template<int D> | |
void | Portage::MedianSelect (int k, int n, std::vector< Point< D > > &arr, int *prm, int icut) |
Macro Definition Documentation
◆ SWAP
#define SWAP | ( | a, | |
b, | |||
type | |||
) |
Value:
{ \
type c_ = b; \
b = a; \
a = c_; \
}