cosmotool/src/mykdtree.hpp

184 lines
4.8 KiB
C++
Raw Normal View History

2009-01-08 16:18:14 +01:00
#ifndef __HV_KDTREE_HPP
#define __HV_KDTREE_HPP
#include <cmath>
#include "config.hpp"
#include "bqueue.hpp"
2009-01-08 16:18:14 +01:00
namespace CosmoTool {
2009-02-04 02:00:46 +01:00
template<int N, typename CType = ComputePrecision>
struct KDDef
2009-01-08 16:18:14 +01:00
{
2009-02-04 02:00:46 +01:00
typedef CType CoordType;
typedef float KDCoordinates[N];
2009-01-08 16:18:14 +01:00
};
2009-02-04 02:00:46 +01:00
template<int N, typename ValType, typename CType = ComputePrecision>
struct KDCell
2009-01-08 16:18:14 +01:00
{
bool active;
ValType val;
2009-02-04 02:00:46 +01:00
typename KDDef<N,CType>::KDCoordinates coord;
2009-01-08 16:18:14 +01:00
};
class NotEnoughCells: public Exception
{
public:
NotEnoughCells() : Exception() {}
~NotEnoughCells() throw () {}
};
class InvalidOnDiskKDTree : public Exception
{
public:
InvalidOnDiskKDTree() : Exception() {}
~InvalidOnDiskKDTree() throw () {}
};
2009-02-04 02:00:46 +01:00
template<int N, typename ValType, typename CType = ComputePrecision>
struct KDTreeNode
2009-01-08 16:18:14 +01:00
{
2009-02-04 02:00:46 +01:00
KDCell<N,ValType,CType> *value;
KDTreeNode<N,ValType,CType> *children[2];
typename KDDef<N,CType>::KDCoordinates minBound, maxBound;
#ifdef __KD_TREE_NUMNODES
uint32_t numNodes;
#endif
2009-01-08 16:18:14 +01:00
};
2009-02-04 02:00:46 +01:00
template<int N, typename ValType, typename CType = ComputePrecision>
2009-01-08 16:18:14 +01:00
class RecursionInfoCells
{
public:
2009-02-04 02:00:46 +01:00
typename KDDef<N,CType>::KDCoordinates x;
typename KDDef<N,CType>::CoordType r, r2;
KDCell<N, ValType,CType> **cells;
typename KDDef<N,CType>::CoordType *distances;
2009-01-08 16:18:14 +01:00
uint32_t currentRank;
uint32_t numCells;
};
2009-01-08 16:18:14 +01:00
2009-02-04 02:00:46 +01:00
template<int N, typename ValType, typename CType = ComputePrecision>
class RecursionMultipleInfo
{
public:
2009-02-04 02:00:46 +01:00
const typename KDDef<N,CType>::KDCoordinates& x;
BoundedQueue< KDCell<N,ValType,CType> *, typename KDDef<N,CType>::CoordType> queue;
int traversed;
2009-02-04 02:00:46 +01:00
RecursionMultipleInfo(const typename KDDef<N,CType>::KDCoordinates& rx,
KDCell<N,ValType,CType> **cells,
uint32_t numCells)
: x(rx), queue(cells, numCells, INFINITY),traversed(0)
{
}
};
template<int N, typename ValType, typename CType = ComputePrecision>
struct KD_default_cell_splitter
{
void operator()(KDCell<N,ValType,CType> **cells, uint32_t Ncells, uint32_t& split_index, int axis, typename KDDef<N,CType>::KDCoordinates minBound, typename KDDef<N,CType>::KDCoordinates maxBound);
};
template<int N, typename ValType, typename CType = ComputePrecision, typename CellSplitter = KD_default_cell_splitter<N,ValType,CType> >
class KDTree
2009-01-08 16:18:14 +01:00
{
public:
2009-02-04 02:00:46 +01:00
typedef typename KDDef<N,CType>::CoordType CoordType;
typedef typename KDDef<N>::KDCoordinates coords;
2009-02-04 02:00:46 +01:00
typedef KDCell<N,ValType,CType> Cell;
typedef KDTreeNode<N,ValType,CType> Node;
CellSplitter splitter;
2009-01-08 16:18:14 +01:00
2009-02-04 02:00:46 +01:00
KDTree(Cell *cells, uint32_t Ncells);
~KDTree();
2009-01-08 16:18:14 +01:00
uint32_t getIntersection(const coords& x, CoordType r,
2009-02-04 02:00:46 +01:00
Cell **cells,
uint32_t numCells)
throw (NotEnoughCells);
uint32_t getIntersection(const coords& x, CoordType r,
2009-02-04 02:00:46 +01:00
Cell **cells,
CoordType *distances,
2009-01-08 16:18:14 +01:00
uint32_t numCells)
throw (NotEnoughCells);
uint32_t countCells(const coords& x, CoordType r);
2009-01-08 16:18:14 +01:00
2009-02-04 02:00:46 +01:00
Cell *getNearestNeighbour(const coords& x);
2009-11-01 18:21:14 +01:00
void getNearestNeighbours(const coords& x, uint32_t NumCells,
2009-02-04 02:00:46 +01:00
Cell **cells);
2009-11-01 18:21:14 +01:00
void getNearestNeighbours(const coords& x, uint32_t NumCells,
2009-02-04 02:00:46 +01:00
Cell **cells,
CoordType *distances);
2009-01-08 16:18:14 +01:00
2009-02-04 02:00:46 +01:00
Node *getRoot() { return root; }
2009-01-08 16:18:14 +01:00
void optimize();
2009-02-04 02:00:46 +01:00
Node *getAllNodes() { return nodes; }
2009-01-08 16:18:14 +01:00
uint32_t getNumNodes() const { return lastNode; }
uint32_t countActives() const;
#ifdef __KD_TREE_NUMNODES
uint32_t getNumberInNode(const Node *n) const { return n->numNodes; }
#else
uint32_t getNumberInNode(const Node *n) const {
if (n == 0)
return 0;
return 1+getNumberInNode(n->children[0])+getNumberInNode(n->children[1]);
}
#endif
#ifdef __KD_TREE_SAVE_ON_DISK
KDTree(std::istream& i, Cell *cells, uint32_t Ncells)
throw (InvalidOnDiskKDTree);
void saveTree(std::ostream& o) const;
#endif
2009-01-08 16:18:14 +01:00
protected:
2009-02-04 02:00:46 +01:00
Node *nodes;
2009-01-08 16:18:14 +01:00
uint32_t numNodes;
uint32_t lastNode;
2009-02-04 02:00:46 +01:00
Node *root;
Cell **sortingHelper;
Cell *base_cell;
2009-01-08 16:18:14 +01:00
2009-02-04 02:00:46 +01:00
Node *buildTree(Cell **cell0,
2009-11-01 18:21:14 +01:00
uint32_t NumCells,
2009-02-04 02:00:46 +01:00
uint32_t depth,
coords minBound,
coords maxBound);
2009-01-08 16:18:14 +01:00
template<bool justCount>
2009-02-04 02:00:46 +01:00
void recursiveIntersectionCells(RecursionInfoCells<N,ValType, CType>& info,
Node *node,
2009-01-08 16:18:14 +01:00
int level)
throw (NotEnoughCells);
CoordType computeDistance(const Cell *cell, const coords& x) const;
2009-02-04 02:00:46 +01:00
void recursiveNearest(Node *node,
2009-01-08 16:18:14 +01:00
int level,
const coords& x,
CoordType& R2,
2009-02-04 02:00:46 +01:00
Cell*& cell);
void recursiveMultipleNearest(RecursionMultipleInfo<N,ValType,CType>& info, Node *node,
int level);
2009-01-08 16:18:14 +01:00
};
2009-02-04 02:00:46 +01:00
template<int N, typename T, typename CType>
uint32_t gatherActiveCells(KDCell<N,T,CType> **cells, uint32_t numCells);
2009-01-08 16:18:14 +01:00
};
#include "mykdtree.tcc"
#endif