Spatial_Tree.h

Go to the documentation of this file.

#ifndef _H_SPATIAL_TREE
#define _H_SPATIAL_TREE

#include "Tree.h"
#include "Polytope.h"
#include "Point.h"
#include "Bounding_Box.h"
#include "Cubic_Bounding_Box_Container.h"
#include "BBGenerator.h"

template < typename tree_type, typename bb_type, typename container_type >
class Spatial_Tree : public Tree< container_type*, tree_type > {
    private:

        public:

                virtual bool checkReady() const { return true; }

                virtual void ensureReady() {}

                virtual ~Spatial_Tree() {}

                //virtual tree_type *insert( Polytope *polytope ) = 0;

                virtual tree_type *insert( container_type *container ) = 0;

                //virtual tree_type *remove( Polytope *polytope ) = 0;

                virtual tree_type *remove( container_type *container ) = 0;

                template < class InputIterator >
                void insertPolytopes( InputIterator begin,  InputIterator end ) { for ( ; begin!=end; ++begin ) insert( extractCubicBoundingBox( *begin ) ); }

                virtual vector<int> neighboursOf( const container_type *item ) const = 0;

                virtual vector<int> neighboursOf( const vector<double> &point, const unsigned int k ) const = 0;


                virtual vector<int> containedIn( const bb_type &box ) const = 0;

                virtual vector<int> intersects( const Point &point ) const = 0;

                virtual vector<int> intersects( const vector<double> &begin, const vector<double> &end ) const = 0;

                virtual vector<int> intersects( const vector<double> &a, const double b ) const = 0;

#ifdef _NODE_COUNT

                virtual int visitedNodes() const = 0;
#endif

};

#endif

---