| 1 | /* | 
|---|
| 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: | 
|---|
| 12 | main-programmer: Patrick Boenzli | 
|---|
| 13 | co-programmer: ... | 
|---|
| 14 | */ | 
|---|
| 15 |  | 
|---|
| 16 | #define DEBUG_SPECIAL_MODULE DEBUG_MODULE_COLLISION_DETECTION | 
|---|
| 17 |  | 
|---|
| 18 | #include "cd_engine.h" | 
|---|
| 19 | #include "obb_tree.h" | 
|---|
| 20 | #include "debug.h" | 
|---|
| 21 |  | 
|---|
| 22 | #include "class_list.h" | 
|---|
| 23 |  | 
|---|
| 24 | #include "model.h" | 
|---|
| 25 | #include "world_entity.h" | 
|---|
| 26 | #include "terrain.h" | 
|---|
| 27 | // #include "player.h" | 
|---|
| 28 |  | 
|---|
| 29 | #include "spatial_separation.h" | 
|---|
| 30 | #include "quadtree.h" | 
|---|
| 31 | #include "quadtree_node.h" | 
|---|
| 32 |  | 
|---|
| 33 | #include "bsp_manager.h" | 
|---|
| 34 | #include "bsp_entity.h" | 
|---|
| 35 |  | 
|---|
| 36 | using namespace std; | 
|---|
| 37 |  | 
|---|
| 38 |  | 
|---|
| 39 | /** | 
|---|
| 40 | *  standard constructor | 
|---|
| 41 | */ | 
|---|
| 42 | CDEngine::CDEngine () | 
|---|
| 43 | { | 
|---|
| 44 | this->setClassID(CL_CD_ENGINE, "CDEngine"); | 
|---|
| 45 |  | 
|---|
| 46 | this->bAbordOnFirstCollision = false; | 
|---|
| 47 | } | 
|---|
| 48 |  | 
|---|
| 49 |  | 
|---|
| 50 | /** | 
|---|
| 51 | *  the singleton reference to this class | 
|---|
| 52 | */ | 
|---|
| 53 | CDEngine* CDEngine::singletonRef = NULL; | 
|---|
| 54 |  | 
|---|
| 55 |  | 
|---|
| 56 | /** | 
|---|
| 57 | *  standard deconstructor | 
|---|
| 58 | */ | 
|---|
| 59 | CDEngine::~CDEngine () | 
|---|
| 60 | { | 
|---|
| 61 | CDEngine::singletonRef = NULL; | 
|---|
| 62 | } | 
|---|
| 63 |  | 
|---|
| 64 |  | 
|---|
| 65 | /** | 
|---|
| 66 | * | 
|---|
| 67 | */ | 
|---|
| 68 | void CDEngine::checkCollisions(ObjectManager::EntityList& list1, ObjectManager::EntityList& list2) | 
|---|
| 69 | { | 
|---|
| 70 | BVTree* tree; | 
|---|
| 71 | ObjectManager::EntityList::iterator entity1, entity2, pre1, pre2; | 
|---|
| 72 | PRINTF(5)("checking for collisions\n"); | 
|---|
| 73 |  | 
|---|
| 74 | pre1 = list1.begin(); | 
|---|
| 75 | while (pre1 != list1.end()) | 
|---|
| 76 | { | 
|---|
| 77 | entity1 = pre1++; | 
|---|
| 78 | if( likely((*entity1) != this->terrain)) | 
|---|
| 79 | { | 
|---|
| 80 | pre2 = list2.begin(); | 
|---|
| 81 | while (pre2 != list2.end()) | 
|---|
| 82 | { | 
|---|
| 83 | entity2 = pre2++; | 
|---|
| 84 | if( likely((*entity2) != this->terrain)) | 
|---|
| 85 | { | 
|---|
| 86 | PRINTF(4)("checking object %s against %s\n", (*entity1)->getName(), (*entity2)->getName()); | 
|---|
| 87 | tree = (*entity1)->getOBBTree(); | 
|---|
| 88 | if( likely(tree != NULL) && (*entity2)->getOBBTree() != NULL) | 
|---|
| 89 | tree->collideWith(*entity1, *entity2); | 
|---|
| 90 | } | 
|---|
| 91 | } | 
|---|
| 92 | } | 
|---|
| 93 | } | 
|---|
| 94 | } | 
|---|
| 95 |  | 
|---|
| 96 |  | 
|---|
| 97 | /** | 
|---|
| 98 | *  this checks the collisions with the ground | 
|---|
| 99 | */ | 
|---|
| 100 | void CDEngine::checkCollisionGround(std::list<WorldEntity*>& list1) | 
|---|
| 101 | { | 
|---|
| 102 |  | 
|---|
| 103 | std::list<BaseObject*>::const_iterator bspIterator; | 
|---|
| 104 | std::list<WorldEntity*>::iterator entityIterator; | 
|---|
| 105 | const std::list<BaseObject*>* bspList = ClassList::getList(CL_BSP_ENTITY); | 
|---|
| 106 | if( bspList == NULL) | 
|---|
| 107 | return; | 
|---|
| 108 |  | 
|---|
| 109 | // for all bsp managers check all entities | 
|---|
| 110 | for( bspIterator = bspList->begin(); bspIterator != bspList->end(); bspIterator++) { | 
|---|
| 111 | for(entityIterator = list1.begin(); entityIterator != list1.end(); entityIterator++) | 
|---|
| 112 | { | 
|---|
| 113 | //         PRINTF(0)("Checking: %s a %s\n", (*entityIterator)->getName(), (*entityIterator)->getClassName()); | 
|---|
| 114 | (dynamic_cast<BspEntity*>(*bspIterator)->getBspManager())->checkCollision(*entityIterator); | 
|---|
| 115 | } | 
|---|
| 116 | } | 
|---|
| 117 | } | 
|---|
| 118 |  | 
|---|
| 119 |  | 
|---|
| 120 | /** | 
|---|
| 121 | * some debug output on the class | 
|---|
| 122 | */ | 
|---|
| 123 | void CDEngine::debug() | 
|---|
| 124 | { | 
|---|
| 125 | PRINT(0)("\n=============================| CDEngine::debug() |===\n"); | 
|---|
| 126 | PRINT(0)("=  CDEngine: Spawning Tree Start\n"); | 
|---|
| 127 | //this->rootTree->debug(); | 
|---|
| 128 | PRINT(0)("=  CDEngine: Spawning Tree: Finished\n"); | 
|---|
| 129 | PRINT(0)("=======================================================\n"); | 
|---|
| 130 | } | 
|---|
| 131 |  | 
|---|
| 132 |  | 
|---|
| 133 | /** | 
|---|
| 134 | * this spawns a tree for debug purposes only | 
|---|
| 135 | */ | 
|---|
| 136 | void CDEngine::debugSpawnTree(int depth, sVec3D* vertices, int numVertices) | 
|---|
| 137 | { | 
|---|
| 138 | //   if ( this->rootTree == NULL) | 
|---|
| 139 | //     this->rootTree = new OBBTree(depth, vertices, numVertices); | 
|---|
| 140 | } | 
|---|
| 141 |  | 
|---|
| 142 |  | 
|---|
| 143 | void CDEngine::drawBV(const ObjectManager::EntityList& drawList, int level) const | 
|---|
| 144 | { | 
|---|
| 145 | ObjectManager::EntityList::const_iterator entity; | 
|---|
| 146 | for (entity = drawList.begin(); entity != drawList.end(); entity++) | 
|---|
| 147 | (*entity)->drawBVTree(level, 226); | 
|---|
| 148 | } | 
|---|
| 149 |  | 
|---|
| 150 |  | 
|---|
| 151 | /** | 
|---|
| 152 | * this draws the debug spawn tree | 
|---|
| 153 | */ | 
|---|
| 154 | void CDEngine::debugDraw(int depth, int drawMode) | 
|---|
| 155 | { | 
|---|
| 156 | //   if(this-> rootTree != NULL) | 
|---|
| 157 | //     this->rootTree->drawBV(depth, drawMode); | 
|---|
| 158 | } | 
|---|