[2014] | 1 | /*! |
---|
| 2 | \file collision.h |
---|
[4836] | 3 | * Basic collision detection |
---|
[2014] | 4 | */ |
---|
[1966] | 5 | |
---|
[3224] | 6 | #ifndef _COLLISION_H |
---|
| 7 | #define _COLLISION_H |
---|
[1966] | 8 | |
---|
[1975] | 9 | #include "vector.h" |
---|
| 10 | #include <stdlib.h> |
---|
| 11 | #include <stdio.h> |
---|
[2166] | 12 | #include <string.h> |
---|
[1966] | 13 | |
---|
[2014] | 14 | //! Tree structure used by the CollisionCluster |
---|
[3231] | 15 | typedef struct CCTree |
---|
[1966] | 16 | { |
---|
| 17 | unsigned long n; |
---|
| 18 | union |
---|
| 19 | { |
---|
[3231] | 20 | struct CCTree** b; |
---|
[1966] | 21 | unsigned long ID; |
---|
| 22 | } data; |
---|
| 23 | float r; |
---|
| 24 | Vector m; |
---|
[3231] | 25 | } CCTree; |
---|
[1966] | 26 | |
---|
[2012] | 27 | //! Basic collision detection class |
---|
[2010] | 28 | /** |
---|
| 29 | This class implements a more or less efficient collision system based on nested hitzones. |
---|
| 30 | Instead of using a brute force approach (try if any hitzone intersects with any other hitzone) |
---|
| 31 | this features a tree of spheric hitzones. Only some of them are actually the solid groundstones |
---|
| 32 | the collision model bases on, the others serve to group them into sets of spheres that are only |
---|
| 33 | checked for collision when the assigned top level sphere has registered a collision, preventing |
---|
| 34 | unnessessary checks (like between every sphere of two collision clusters at the other end of the world) |
---|
| 35 | from being performed. |
---|
| 36 | The CollisionCluster features collision detection between multiple CollisionClusters as well as |
---|
| 37 | traceing a collision between a line of defined length and a cluster. In both cases the base spheres |
---|
| 38 | that have intersected are marked with a flag in an unsigned long for hitlocation queries. In the case |
---|
| 39 | of a trace, the exact point of interception is returned as well. |
---|
| 40 | */ |
---|
[1966] | 41 | class CollisionCluster { |
---|
| 42 | |
---|
[3231] | 43 | CCTree* root; |
---|
[1966] | 44 | |
---|
| 45 | |
---|
| 46 | public: |
---|
| 47 | CollisionCluster (float r, Vector m); // simple cluster |
---|
| 48 | CollisionCluster (char* filename); // get cluster from file |
---|
| 49 | ~CollisionCluster (); |
---|
| 50 | |
---|
| 51 | int store (char* filename); |
---|
| 52 | |
---|
[3237] | 53 | friend bool ccTreeTrace( const Placement* p, CCTree* t, unsigned long* hitflags, const Line* trace, Vector* impactpoint); |
---|
| 54 | friend bool ccTreeIterate(const Placement* pa, CCTree* ta, unsigned long* ahitflags, const Placement* pb, CCTree* tb, unsigned long* bhitflags); |
---|
[3231] | 55 | friend bool checkTrace (const Placement* pa, const CollisionCluster* a, unsigned long* ahitflags, const Line* trace, Vector* impactpoint); |
---|
| 56 | friend bool checkCollision (const Placement* pa, const CollisionCluster* a, unsigned long* ahitflags, const Placement* pb, const CollisionCluster* b, unsigned long* bhitflags); |
---|
[1966] | 57 | }; |
---|
| 58 | |
---|
[3231] | 59 | bool sphereSphereCollision( Vector m1, float r1, Vector m2, float r2); |
---|
| 60 | bool traceSphereCollision( Vector m, float r, const Line* l, Vector* impactpoint); |
---|
[1966] | 61 | |
---|
| 62 | void setflag( unsigned long* flags, unsigned long ID); |
---|
| 63 | |
---|
[3231] | 64 | void freeCCTree( CCTree* tree); |
---|
| 65 | CCTree* loadCCTree (FILE* stream); |
---|
| 66 | int saveCCTree (CCTree* tree, FILE* stream); |
---|
[1966] | 67 | |
---|
[3224] | 68 | #endif /* _COLLISION_H */ |
---|