33 #ifndef DIME_BSPTREE_H
34 #define DIME_BSPTREE_H
36 #include <dime/Basic.h>
37 #include <dime/util/Array.h>
38 #include <dime/util/Linear.h>
46 dimeBSPTree(
const int maxnodepts = 64,
const int initsize = 4);
49 int numPoints()
const;
50 void getPoint(
const int idx,
dimeVec3f &pt);
51 void *getUserData(
const int idx)
const;
53 void setUserData(
const int idx,
void *
const data);
55 int addPoint(
const dimeVec3f &pt,
void *
const userdata = NULL);
57 void removePoint(
const int idx);
58 int findPoint(
const dimeVec3f &pos)
const;
59 void clear(
const int initsize = 4);
64 friend class dime_bspnode;
67 dime_bspnode *topnode;
72 #endif // ! DIME_BSPTREE_H
~dimeBSPTree()
Definition: BSPTree.cpp:275
int numPoints() const
Definition: BSPTree.cpp:285
int removePoint(const dimeVec3f &pt)
Definition: BSPTree.cpp:343
void * getUserData(const int idx) const
Definition: BSPTree.cpp:305
int addPoint(const dimeVec3f &pt, void *const userdata=NULL)
Definition: BSPTree.cpp:329
dimeBSPTree(const int maxnodepts=64, const int initsize=4)
Definition: BSPTree.cpp:263
int count() const
Definition: Array.h:256
void setUserData(const int idx, void *const data)
Definition: BSPTree.cpp:315
void clear(const int initsize=4)
Definition: BSPTree.cpp:378
The dimeVec3f class is for containing and operating on a 3D vector / coordinate.
Definition: Linear.h:61
int findPoint(const dimeVec3f &pos) const
Definition: BSPTree.cpp:366
The dimeBSPTree class is a simple BSP tree implementation.
Definition: BSPTree.h:43
void getPoint(const int idx, dimeVec3f &pt)
Definition: BSPTree.cpp:295
const dimeBox * getBBox() const
Definition: BSPTree.cpp:393
void makeEmpty(const int initsize=4)
Definition: Array.h:280
Copyright © by Kongsberg Oil & Gas Technologies. All rights reserved.
Generated on Tue Mar 24 2020 14:02:59 for Dime by Doxygen 1.8.17.