Preliminary simple BSP tree, without automatic retriangulation
This commit is contained in:
parent
134f4413eb
commit
0bbc9fe5eb
3 changed files with 282 additions and 0 deletions
12
sample/testBSP.cpp
Normal file
12
sample/testBSP.cpp
Normal file
|
@ -0,0 +1,12 @@
|
|||
#include "bsp_simple.hpp"
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
CosmoTool::simple_bsp::BSP<int, double, 2> bsp;
|
||||
double p[5][2] = { { 0, 0}, {1, 0}, {1, 1}, {0, 1}, {0, 0} };
|
||||
|
||||
for (int q = 0; q < 4; q++)
|
||||
bsp.insert(p+q, p+q+2, q);
|
||||
|
||||
return 0;
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue