Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: orxonox.OLD/trunk/src/lib/collision_detection/obb_tree.cc @ 5679

Last change on this file since 5679 was 5481, checked in by bensch, 19 years ago

orxonox/trunk: BV-nodes are now renddered more efficiently.

File size: 3.2 KB
RevLine 
[4573]1/*
[4510]2   orxonox - the future of 3D-vertical-scrollers
3
4   Copyright (C) 2004 orx
5
6   This program is free software; you can redistribute it and/or modify
7   it under the terms of the GNU General Public License as published by
8   the Free Software Foundation; either version 2, or (at your option)
9   any later version.
10
11   ### File Specific:
[4511]12   main-programmer: Patrick Boenzli
[4510]13   co-programmer: ...
14*/
15
[4511]16#define DEBUG_SPECIAL_MODULE DEBUG_MODULE_COLLISION
[4510]17
[4511]18#include "obb_tree.h"
[4550]19#include "obb_tree_node.h"
[4531]20#include "obb.h"
[4546]21#include "debug.h"
[4550]22#include "compiler.h"
[4616]23#include "material.h"
[5026]24#include "world_entity.h"
[4700]25#include "p_node.h"
[4510]26
27using namespace std;
28
29
30/**
[4836]31 *  standard constructor
[4510]32*/
[4573]33OBBTree::OBBTree ()
[4510]34{
[4682]35  this->init();
36}
37
38OBBTree::OBBTree(int depth, sVec3D *verticesList, const int length)
39{
40  this->init();
41  this->spawnBVTree(depth, verticesList, length);
42}
43
44
45
46void OBBTree::init()
47{
[4616]48  this->setClassID(CL_OBB_TREE, "OBBTree");
[4622]49
[5115]50  this->rootNode = NULL;
51
[4638]52  this->id = 0;
[4510]53}
54
55/**
[4836]56 *  standard deconstructor
[4510]57
58*/
[4573]59OBBTree::~OBBTree ()
[4510]60{
[4814]61  delete this->rootNode;
[4510]62}
[4528]63
64
[4551]65void OBBTree::spawnBVTree(int depth, sVec3D *verticesList, const int length)
[4531]66{
[4551]67  if( unlikely(this->rootNode != NULL))
68    {
69      PRINTF(2)("The BVTree has already been spawned, flushing and respawning again...\n");
70      this->flushTree();
71    }
72  OBBTreeNode* node = new OBBTreeNode();
73  this->rootNode = node;
[4622]74  this->rootNode->setTreeRef(this);
[4626]75  this->rootNode->spawnBVTree(--depth, verticesList, length);
[4531]76}
[4528]77
78
79void OBBTree:: flushTree()
80{}
81
82
[5026]83void OBBTree::collideWith(WorldEntity* entity1, WorldEntity* entity2)
84{
[5027]85  if( likely(entity2->getOBBTree() != NULL) )
[5028]86    this->rootNode->collideWith(((OBBTree*)entity2->getOBBTree())->getRootNode(), entity1, entity2);
[5026]87}
88
89
90/**
91 * this collides two bvtrees together. the trees are attached to pnodes Objects A and B
92 * @param tree: the other tree to collide with (Object B)
93 * @param nodeA: PNode of object A
94 * @param nodeB: Pnode of object B
95 */
[5028]96void OBBTree::collideWith(BVTree* tree, WorldEntity* nodeA, WorldEntity* nodeB)
[4695]97{
[4700]98  this->rootNode->collideWith(((OBBTree*)tree)->getRootNode(), nodeA, nodeB);
[4695]99}
[4528]100
101
[4635]102void OBBTree::drawBV(int depth, int drawMode) const
[4550]103{
104  if( likely(this->rootNode != NULL))
[4581]105  {
[4635]106    this->rootNode->drawBV(depth, drawMode);
[4581]107  }
[4550]108}
[4528]109
110
111
[4546]112void OBBTree::debug()
113{
114  PRINT(0)("\n==============================| OBBTree::debug() |===\n");
115  PRINT(0)("=  Spawning Tree: Start\n");
[4573]116
[4551]117  /* generate some test vertices */
[4638]118  int const length = 9;
[4589]119  sVec3D* vertList = new sVec3D[length];
[4668]120//   sVec3D data[length]  = {{0.0, 0.0, 0.0},{1.0, 2.0, 5.0},{0.0, 6.0, 9.0},
121//                           {1.0, 4.0, 12.0}, {1.0, 2.0, 16.0}, {0.0, 0.0, 19.0},
122//                           {0.0, 3.0, 23.0}, {1.0, 5.0, 30.0}, {0.0, 10.0, 35.0}};
[4551]123
[4668]124  sVec3D data[length]  = {{0.0, 0.0, 0.0},{1.0, 2.0, 5.0},{1.0, 5.0, 30.0},
125                          {0.0, 3.0, 23.0}, {0.0, 6.0, 9.0}, {0.0, 10.0, 35.0},
126                          {1.0, 4.0, 12.0}, {1.0, 2.0, 16.0}, {0.0, 0.0, 19.0}};
127
[4589]128  for(int i = 0; i < length; ++i)
[4553]129    {
130      vertList[i][0] = data[i][0];
131      vertList[i][1] = data[i][1];
132      vertList[i][2] = data[i][2];
133    }
134
[4638]135  this->spawnBVTree(3, vertList, length);
[4551]136
[4546]137  PRINT(0)("=  Spawning Tree: Finished\n");
[4573]138  PRINT(0)("=======================================================\n");
[4546]139
140}
Note: See TracBrowser for help on using the repository browser.