33 COLLISION_USE_COLLFACE = (1 << 2),
34 COLLISION_IS_EDGES = (1 << 3),
90 const int3 *vert_tris,
94 const float (*positions)[3],
95 const float (*positions_moving)[3],
96 const int3 *vert_tris,
140 unsigned int modifier_type);
152 unsigned int *numcollobj,
153 unsigned int modifier_type);
These structs are the foundation for all linked lists in the library system.
VecBase< float, D > step(VecOp< float, D >, VecOp< float, D >) RET
void BKE_collider_cache_free(ListBaseT< ColliderCache > **colliders)
void collision_move_object(struct CollisionModifierData *collmd, float step, float prevstep, bool moving_bvh)
void BKE_collision_relations_free(ListBaseT< CollisionRelation > *relations)
void collision_get_collider_velocity(float vel_old[3], float vel_new[3], struct CollisionModifierData *collmd, struct CollPair *collpair)
struct BVHTree * bvhtree_build_from_mvert(const float(*positions)[3], const int3 *vert_tris, int tri_num, float epsilon)
VecBase< int32_t, 3 > int3
ListBaseT< ColliderCache > * BKE_collider_cache_create(struct Depsgraph *depsgraph, struct Object *self, struct Collection *collection)
struct Object ** BKE_collision_objects_create(struct Depsgraph *depsgraph, struct Object *self, struct Collection *collection, unsigned int *numcollobj, unsigned int modifier_type)
void bvhtree_update_from_mvert(struct BVHTree *bvhtree, const float(*positions)[3], const float(*positions_moving)[3], const int3 *vert_tris, int tri_num, bool moving)
ListBaseT< CollisionRelation > * BKE_collision_relations_create(struct Depsgraph *depsgraph, struct Collection *collection, unsigned int modifier_type)
void BKE_collision_objects_free(struct Object **objects)
struct ColliderCache * next
struct ColliderCache * prev
struct CollisionModifierData * collmd
struct CollisionRelation * prev
struct CollisionRelation * next