---

gtccollider.h

/*
    Sebastien Loisel's Toolchest
    Copyright (C) 1998 Sebastien Loisel

    $Header: /home/gtc/public_html/gtc-cvs/toolchest/include/gtccollider.h,v 1.8 2000/01/04 04:08:17 loisel Exp $
    */
#ifndef Z_COLLIDER_H
#define Z_COLLIDER_H

#include <gtcutils.h>

typedef void (*gtcboing)(void *a, void *b, void *data);
/* performance of gtc_collider is roughly nlogn in numb in cases where
   the actual number of collisions is small but the constant is large
   and in cases where actual number of collisions or near collisions is
   large, the algorithm becomes quadratic AND it starts eating up lots
   of space. */
typedef struct
{
  gtcReal box[3][2];
  void *data;
} gtcBBox;
void gtc_collider(gtcBBox *bboxes[], int numb, gtcboing bong,
                  void *data);
/* performance is always quadratic, with small constant and doesn't use
     any space except that of the parameters. */
void gtc_naive_collider(gtcBBox *bboxes[], int numb, gtcboing bong,
                        void *data);
/* experience suggests that for numb>200, gtc_collider becomes superior to
     gtc_naive_collider */

typedef struct _gtcAABBTree gtcAABBTree;
struct _gtcAABBTree
{
  gtcReal box[3][2];
  gtcAABBTree *left, *right;
  int tri;
};

gtcAABBTree *gtc_make_tree(int (*f)[3], gtcReal (*v)[3], int numf);
int gtc_collide_AABBTrees(gtcAABBTree *A, gtcAABBTree *B,
                          gtcReal M[4][4], gtcReal N[4][4],
                          int (*cb)(int a, int b, void *data),
                          void *data);

#endif
 

---