Last change
on this file since 4543 was
4542,
checked in by patrick, 19 years ago
|
some more structural work and start of spawn tree function
|
File size:
1.1 KB
|
Line | |
---|
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 |
---|
17 | |
---|
18 | #include "obb_tree.h" |
---|
19 | #include "obb.h" |
---|
20 | |
---|
21 | using namespace std; |
---|
22 | |
---|
23 | |
---|
24 | /** |
---|
25 | \brief standard constructor |
---|
26 | */ |
---|
27 | OBBTree::OBBTree () |
---|
28 | { |
---|
29 | this->setClassID(CL_OBB_TREE, "OBBTree"); |
---|
30 | |
---|
31 | } |
---|
32 | |
---|
33 | |
---|
34 | /** |
---|
35 | \brief standard deconstructor |
---|
36 | |
---|
37 | */ |
---|
38 | OBBTree::~OBBTree () |
---|
39 | { |
---|
40 | // delete what has to be deleted here |
---|
41 | } |
---|
42 | |
---|
43 | |
---|
44 | void OBBTree::spawnBVTree(int depth) |
---|
45 | { |
---|
46 | |
---|
47 | } |
---|
48 | |
---|
49 | |
---|
50 | void OBBTree:: flushTree() |
---|
51 | {} |
---|
52 | |
---|
53 | |
---|
54 | void OBBTree::collideWith(const OBBTree &tree) |
---|
55 | {} |
---|
56 | |
---|
57 | |
---|
58 | void OBBTree::drawBV(int currentDepth, const int depth) const |
---|
59 | {} |
---|
60 | |
---|
61 | |
---|
62 | void OBBTree::drawBVPolygon(int currentDepth, const int depth) const |
---|
63 | {} |
---|
64 | |
---|
65 | |
---|
66 | void OBBTree::drawBVBlended(int currentDepth, const int depth) const |
---|
67 | {} |
---|
Note: See
TracBrowser
for help on using the repository browser.