Home
last modified time | relevance | path

Searched refs:aabb (Results 1 – 25 of 1706) sorted by relevance

12345678910>>...69

/dports/games/netradiant/netradiant-20150621-src/libs/math/
H A Daabb.h63 AABB aabb; in aabb_for_minmax() local
65 aabb.extents = vector3_subtracted( max, aabb.origin ); in aabb_for_minmax()
66 return aabb; in aabb_for_minmax()
110 aabb.origin = point; in aabb_extend_by_point_safe()
119 AABBExtendByPoint( AABB& aabb ) : m_aabb( aabb ){ in AABBExtendByPoint() argument
137 aabb = other; in aabb_extend_by_aabb_safe()
199 Vector3 min( vector3_subtracted( aabb.origin, aabb.extents ) ); in aabb_corners()
200 Vector3 max( vector3_added( aabb.origin, aabb.extents ) ); in aabb_corners()
227 planes[0] = Plane3( g_vector3_axes[0], aabb.origin[0] + aabb.extents[0] ); in aabb_planes()
229 planes[2] = Plane3( g_vector3_axes[1], aabb.origin[1] + aabb.extents[1] ); in aabb_planes()
[all …]
/dports/games/gtkradiant/GPL/GtkRadiant/libs/math/
H A Daabb.h69 AABB aabb; in aabb_for_minmax() local
71 aabb.extents = vector3_subtracted(max, aabb.origin); in aabb_for_minmax()
72 return aabb; in aabb_for_minmax()
119 if(aabb_valid(aabb)) in aabb_extend_by_point_safe()
134 AABBExtendByPoint(AABB& aabb) : m_aabb(aabb) in AABBExtendByPoint() argument
158 aabb = other; in aabb_extend_by_aabb_safe()
232 Vector3 min(vector3_subtracted(aabb.origin, aabb.extents)); in aabb_corners()
233 Vector3 max(vector3_added(aabb.origin, aabb.extents)); in aabb_corners()
246 planes[0] = Plane3(g_vector3_axes[0], aabb.origin[0] + aabb.extents[0]); in aabb_planes()
248 planes[2] = Plane3(g_vector3_axes[1], aabb.origin[1] + aabb.extents[1]); in aabb_planes()
[all …]
/dports/comms/cubicsdr/CubicSDR-0248e5a/external/cubicvr2/math/
H A Daabb.h19 struct aabb { struct
27 aabb() { in aabb() argument
31 aabb engulf(aabb aabb, vec3 point) { in engulf() argument
50 return aabb; in engulf()
53 static aabb reset(aabb aabb, vec3 point=vec3(0.0f,0.0f,0.0f)) {
62 return aabb;
65 static vec3 size(aabb aabb) { in size() argument
66 … __float x = aabb.min[0] < aabb.max[0] ? aabb.max[0] - aabb.min[0] : aabb.min[0] - aabb.max[0]; in size()
67 … __float y = aabb.min[1] < aabb.max[1] ? aabb.max[1] - aabb.min[1] : aabb.min[1] - aabb.max[1]; in size()
68 … __float z = aabb.min[2] < aabb.max[2] ? aabb.max[2] - aabb.min[2] : aabb.min[2] - aabb.max[2]; in size()
[all …]
/dports/games/ufoai/ufoai-2.5-source/src/tools/radiant/libs/math/
H A Daabb.h110 AABB aabb; in createFromMinMax() local
112 aabb.extents = max - aabb.origin; in createFromMinMax()
113 return aabb; in createFromMinMax()
199 return origin_valid(aabb.origin[0]) && origin_valid(aabb.origin[1]) && origin_valid(aabb.origin[2]) in aabb_valid()
200 …&& extents_valid(aabb.extents[0]) && extents_valid(aabb.extents[1]) && extents_valid(aabb.extents[… in aabb_valid()
229 aabb.origin = point; in aabb_extend_by_point_safe()
239 m_aabb(aabb) in AABBExtendByPoint()
314 Vector3 min(aabb.origin - aabb.extents); in aabb_corners()
315 Vector3 max(aabb.origin + aabb.extents); in aabb_corners()
377 … * aabb.extents[0]) + fabs(transform[4] * aabb.extents[1]) + fabs(transform[8] * aabb.extents[2])), in aabb_for_oriented_aabb()
[all …]
/dports/games/gtkradiant/GPL/GtkRadiant/libs/mathlib/
H A Dbbox.c34 VectorSubtract(max, aabb->origin, aabb->extents); in aabb_construct_for_vec3()
59 min = aabb->origin[i] - aabb->extents[i]; in aabb_extend_by_point()
64 max = aabb->origin[i] + aabb->extents[i]; in aabb_extend_by_point()
68 aabb->extents[i] = max - aabb->origin[i]; in aabb_extend_by_point()
121 min = aabb->origin[i] - aabb->extents[i]; in aabb_extend_by_aabb()
127 max = aabb->origin[i] + aabb->extents[i]; in aabb_extend_by_aabb()
130 aabb->extents[i] = max - aabb->origin[i]; in aabb_extend_by_aabb()
137 VectorAdd(aabb->extents, extension, aabb->extents); in aabb_extend_by_vec3()
318 VectorCopy(bbox->aabb.origin, aabb->origin); in aabb_for_bbox()
356 VectorAdd(aabb->origin, aabb->extents, max); in aabb_corners()
[all …]
/dports/games/netradiant/netradiant-20150621-src/libs/mathlib/
H A Dbbox.c33 VectorSubtract( max, aabb->origin, aabb->extents ); in aabb_construct_for_vec3()
53 min = aabb->origin[i] - aabb->extents[i]; in aabb_extend_by_point()
58 max = aabb->origin[i] + aabb->extents[i]; in aabb_extend_by_point()
62 aabb->extents[i] = max - aabb->origin[i]; in aabb_extend_by_point()
109 min = aabb->origin[i] - aabb->extents[i]; in aabb_extend_by_aabb()
115 max = aabb->origin[i] + aabb->extents[i]; in aabb_extend_by_aabb()
118 aabb->extents[i] = max - aabb->origin[i]; in aabb_extend_by_aabb()
124 VectorAdd( aabb->extents, extension, aabb->extents ); in aabb_extend_by_vec3()
311 VectorCopy( bbox->aabb.origin, aabb->origin ); in aabb_for_bbox()
350 VectorAdd( aabb->origin, aabb->extents, max ); in aabb_corners()
[all …]
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/meta/tests/
H A Dtest_intersection_rayaabb.cpp50 const AABB3d aabb(Vector3d(-1.0), Vector3d(1.0)); in TEST_SUITE() local
60 const AABB3d aabb(Vector3d(-1.0), Vector3d(1.0)); in TEST_SUITE() local
70 const AABB3d aabb(Vector3d(-1.0), Vector3d(1.0)); in TEST_SUITE() local
80 const AABB3d aabb(Vector3d(-1.0), Vector3d(1.0)); in TEST_SUITE() local
90 const AABB3d aabb(Vector3d(-1.0), Vector3d(1.0)); in TEST_SUITE() local
100 const AABB3d aabb(Vector3d(-1.0), Vector3d(1.0)); in TEST_SUITE() local
120 const AABB3d aabb(Vector3d(0.0), Vector3d(1.0)); in TEST_SUITE() local
130 const AABB3d aabb(Vector3d(0.0), Vector3d(1.0)); in TEST_SUITE() local
140 const AABB3d aabb(Vector3d(0.0), Vector3d(1.0)); in TEST_SUITE() local
150 const AABB3d aabb(Vector3d(0.0), Vector3d(1.0)); in TEST_SUITE() local
[all …]
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/math/intersection/
H A Dfrustumaabb.h50 const AABB<T, 3>& aabb);
60 const AABB<T, 3>& aabb) in intersect() argument
68 …outside += plane[0] * aabb.min[0] + plane[1] * aabb.min[1] + plane[2] * aabb.min[2] + plane[3] > T… in intersect()
69 …outside += plane[0] * aabb.min[0] + plane[1] * aabb.min[1] + plane[2] * aabb.max[2] + plane[3] > T… in intersect()
70 …outside += plane[0] * aabb.min[0] + plane[1] * aabb.max[1] + plane[2] * aabb.min[2] + plane[3] > T… in intersect()
71 …outside += plane[0] * aabb.min[0] + plane[1] * aabb.max[1] + plane[2] * aabb.max[2] + plane[3] > T… in intersect()
72 …outside += plane[0] * aabb.max[0] + plane[1] * aabb.min[1] + plane[2] * aabb.min[2] + plane[3] > T… in intersect()
73 …outside += plane[0] * aabb.max[0] + plane[1] * aabb.min[1] + plane[2] * aabb.max[2] + plane[3] > T… in intersect()
74 …outside += plane[0] * aabb.max[0] + plane[1] * aabb.max[1] + plane[2] * aabb.min[2] + plane[3] > T… in intersect()
75 …outside += plane[0] * aabb.max[0] + plane[1] * aabb.max[1] + plane[2] * aabb.max[2] + plane[3] > T… in intersect()
/dports/misc/box2d/box2d-2.4.1/src/collision/
H A Db2_dynamic_tree.cpp329 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
457 A->aabb.Combine(B->aabb, G->aabb); in Balance()
458 C->aabb.Combine(A->aabb, F->aabb); in Balance()
468 A->aabb.Combine(B->aabb, F->aabb); in Balance()
469 C->aabb.Combine(A->aabb, G->aabb); in Balance()
517 A->aabb.Combine(C->aabb, E->aabb); in Balance()
518 B->aabb.Combine(A->aabb, D->aabb); in Balance()
528 A->aabb.Combine(C->aabb, D->aabb); in Balance()
529 B->aabb.Combine(A->aabb, E->aabb); in Balance()
665 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/devel/love/love-11.3/src/libraries/Box2D/Collision/
H A Db2DynamicTree.cpp308 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
436 A->aabb.Combine(B->aabb, G->aabb); in Balance()
437 C->aabb.Combine(A->aabb, F->aabb); in Balance()
447 A->aabb.Combine(B->aabb, F->aabb); in Balance()
448 C->aabb.Combine(A->aabb, G->aabb); in Balance()
496 A->aabb.Combine(C->aabb, E->aabb); in Balance()
497 B->aabb.Combine(A->aabb, D->aabb); in Balance()
507 A->aabb.Combine(C->aabb, D->aabb); in Balance()
508 B->aabb.Combine(A->aabb, E->aabb); in Balance()
644 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/devel/love10/love-0.10.2/src/libraries/Box2D/Collision/
H A Db2DynamicTree.cpp308 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
436 A->aabb.Combine(B->aabb, G->aabb); in Balance()
437 C->aabb.Combine(A->aabb, F->aabb); in Balance()
447 A->aabb.Combine(B->aabb, F->aabb); in Balance()
448 C->aabb.Combine(A->aabb, G->aabb); in Balance()
496 A->aabb.Combine(C->aabb, E->aabb); in Balance()
497 B->aabb.Combine(A->aabb, D->aabb); in Balance()
507 A->aabb.Combine(C->aabb, D->aabb); in Balance()
508 B->aabb.Combine(A->aabb, E->aabb); in Balance()
644 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Box2D/Box2D/Collision/
H A Db2DynamicTree.cpp308 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
436 A->aabb.Combine(B->aabb, G->aabb); in Balance()
437 C->aabb.Combine(A->aabb, F->aabb); in Balance()
447 A->aabb.Combine(B->aabb, F->aabb); in Balance()
448 C->aabb.Combine(A->aabb, G->aabb); in Balance()
496 A->aabb.Combine(C->aabb, E->aabb); in Balance()
497 B->aabb.Combine(A->aabb, D->aabb); in Balance()
507 A->aabb.Combine(C->aabb, D->aabb); in Balance()
508 B->aabb.Combine(A->aabb, E->aabb); in Balance()
644 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/graphics/py-box2d-py/box2d-py-2.3.8/Box2D/Collision/
H A Db2DynamicTree.cpp311 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
439 A->aabb.Combine(B->aabb, G->aabb); in Balance()
440 C->aabb.Combine(A->aabb, F->aabb); in Balance()
450 A->aabb.Combine(B->aabb, F->aabb); in Balance()
451 C->aabb.Combine(A->aabb, G->aabb); in Balance()
499 A->aabb.Combine(C->aabb, E->aabb); in Balance()
500 B->aabb.Combine(A->aabb, D->aabb); in Balance()
510 A->aabb.Combine(C->aabb, D->aabb); in Balance()
511 B->aabb.Combine(A->aabb, E->aabb); in Balance()
647 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/games/openclaw/OpenClaw-0.0-51-gbac7730/Box2D/Box2D/Collision/
H A Db2DynamicTree.cpp308 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
436 A->aabb.Combine(B->aabb, G->aabb); in Balance()
437 C->aabb.Combine(A->aabb, F->aabb); in Balance()
447 A->aabb.Combine(B->aabb, F->aabb); in Balance()
448 C->aabb.Combine(A->aabb, G->aabb); in Balance()
496 A->aabb.Combine(C->aabb, E->aabb); in Balance()
497 B->aabb.Combine(A->aabb, D->aabb); in Balance()
507 A->aabb.Combine(C->aabb, D->aabb); in Balance()
508 B->aabb.Combine(A->aabb, E->aabb); in Balance()
644 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/games/emptyepsilon/SeriousProton-EE-2021.06.23/src/Box2D/Collision/
H A Db2DynamicTree.cpp308 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
436 A->aabb.Combine(B->aabb, G->aabb); in Balance()
437 C->aabb.Combine(A->aabb, F->aabb); in Balance()
447 A->aabb.Combine(B->aabb, F->aabb); in Balance()
448 C->aabb.Combine(A->aabb, G->aabb); in Balance()
496 A->aabb.Combine(C->aabb, E->aabb); in Balance()
497 B->aabb.Combine(A->aabb, D->aabb); in Balance()
507 A->aabb.Combine(C->aabb, D->aabb); in Balance()
508 B->aabb.Combine(A->aabb, E->aabb); in Balance()
644 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/x11-toolkits/qml-box2d/qml-box2d-21e57f/Box2D/Collision/
H A Db2DynamicTree.cpp308 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
436 A->aabb.Combine(B->aabb, G->aabb); in Balance()
437 C->aabb.Combine(A->aabb, F->aabb); in Balance()
447 A->aabb.Combine(B->aabb, F->aabb); in Balance()
448 C->aabb.Combine(A->aabb, G->aabb); in Balance()
496 A->aabb.Combine(C->aabb, E->aabb); in Balance()
497 B->aabb.Combine(A->aabb, D->aabb); in Balance()
507 A->aabb.Combine(C->aabb, D->aabb); in Balance()
508 B->aabb.Combine(A->aabb, E->aabb); in Balance()
644 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/devel/juce/JUCE-f37e9a1/modules/juce_box2d/box2d/Collision/
H A Db2DynamicTree.cpp311 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
439 A->aabb.Combine(B->aabb, G->aabb); in Balance()
440 C->aabb.Combine(A->aabb, F->aabb); in Balance()
450 A->aabb.Combine(B->aabb, F->aabb); in Balance()
451 C->aabb.Combine(A->aabb, G->aabb); in Balance()
499 A->aabb.Combine(C->aabb, E->aabb); in Balance()
500 B->aabb.Combine(A->aabb, D->aabb); in Balance()
510 A->aabb.Combine(C->aabb, D->aabb); in Balance()
511 B->aabb.Combine(A->aabb, E->aabb); in Balance()
648 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/devel/love08/love-0.8.0/src/libraries/Box2D/Collision/
H A Db2DynamicTree.cpp311 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
439 A->aabb.Combine(B->aabb, G->aabb); in Balance()
440 C->aabb.Combine(A->aabb, F->aabb); in Balance()
450 A->aabb.Combine(B->aabb, F->aabb); in Balance()
451 C->aabb.Combine(A->aabb, G->aabb); in Balance()
499 A->aabb.Combine(C->aabb, E->aabb); in Balance()
500 B->aabb.Combine(A->aabb, D->aabb); in Balance()
510 A->aabb.Combine(C->aabb, D->aabb); in Balance()
511 B->aabb.Combine(A->aabb, E->aabb); in Balance()
647 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/box2d/Box2D/Collision/
H A Db2DynamicTree.cpp311 m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in InsertLeaf()
439 A->aabb.Combine(B->aabb, G->aabb); in Balance()
440 C->aabb.Combine(A->aabb, F->aabb); in Balance()
450 A->aabb.Combine(B->aabb, F->aabb); in Balance()
451 C->aabb.Combine(A->aabb, G->aabb); in Balance()
499 A->aabb.Combine(C->aabb, E->aabb); in Balance()
500 B->aabb.Combine(A->aabb, D->aabb); in Balance()
510 A->aabb.Combine(C->aabb, D->aabb); in Balance()
511 B->aabb.Combine(A->aabb, E->aabb); in Balance()
647 aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb); in ValidateMetrics()
[all …]
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/aabb-quadtree-0.1.0/src/
H A Dlib.rs25 fn aabb(&self) -> Rect; in aabb() method
58 aabb: Rect,
65 aabb: Rect,
75 ref aabb, in clone()
88 aabb: aabb.clone(), in clone()
100 aabb: aabb.clone(), in clone()
241 &QuadNode::Branch { ref aabb, .. } => aabb.clone(), in bounding_box()
242 &QuadNode::Leaf { ref aabb, .. } => aabb.clone(), in bounding_box()
248 aabb: aabb, in new_leaf()
320 aabb: *aabb, in insert()
[all …]
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/space/index/kdtree/
H A Dkdtree_face.h53 AxisAlignedBoxType aabb; variable
67 node.aabb = mesh.bbox; in epsilon()
182 VectorType diag = node.aabb.max - node.aabb.min; in createTree()
189 node.splitValue = Scalar(0.5*(node.aabb.max[dim] + node.aabb.min[dim])); in createTree()
197 leftBox.Add(VectorType(node.splitValue, node.aabb.max[1], node.aabb.max[2])); in createTree()
198 rightBox.Add(VectorType(node.splitValue, node.aabb.min[1], node.aabb.min[2])); in createTree()
202 leftBox.Add(VectorType(node.aabb.max[0], node.splitValue, node.aabb.max[2])); in createTree()
203 rightBox.Add(VectorType(node.aabb.min[0], node.splitValue, node.aabb.min[2])); in createTree()
207 leftBox.Add(VectorType(node.aabb.max[0], node.aabb.max[1], node.splitValue)); in createTree()
208 rightBox.Add(VectorType(node.aabb.min[0], node.aabb.min[1], node.splitValue)); in createTree()
[all …]
/dports/games/kolf/kolf-21.12.3/external/Box2D/Collision/
H A Db2DynamicTree.cpp107 m_nodes[proxyId].aabb.lowerBound = aabb.lowerBound - r; in CreateProxy()
108 m_nodes[proxyId].aabb.upperBound = aabb.upperBound + r; in CreateProxy()
132 if (m_nodes[proxyId].aabb.Contains(aabb)) in MoveProxy()
206 b2AABB aabb; in InsertLeaf() local
207 aabb.Combine(leafAABB, m_nodes[child1].aabb); in InsertLeaf()
212 b2AABB aabb; in InsertLeaf() local
213 aabb.Combine(leafAABB, m_nodes[child1].aabb); in InsertLeaf()
222 b2AABB aabb; in InsertLeaf() local
223 aabb.Combine(leafAABB, m_nodes[child2].aabb); in InsertLeaf()
228 b2AABB aabb; in InsertLeaf() local
[all …]
/dports/graphics/reactphysics3d/reactphysics3d-0.8.0/src/collision/broadphase/
H A DDynamicAABBTree.cpp140 mNodes[nodeID].aabb.setMin(aabb.getMin() - gap); in addObjectInternal()
141 mNodes[nodeID].aabb.setMax(aabb.getMax() + gap); in addObjectInternal()
473 nodeA->aabb.mergeTwoAABBs(nodeB->aabb, nodeG->aabb); in balanceSubTreeAtNode()
474 nodeC->aabb.mergeTwoAABBs(nodeA->aabb, nodeF->aabb); in balanceSubTreeAtNode()
488 nodeA->aabb.mergeTwoAABBs(nodeB->aabb, nodeF->aabb); in balanceSubTreeAtNode()
489 nodeC->aabb.mergeTwoAABBs(nodeA->aabb, nodeG->aabb); in balanceSubTreeAtNode()
543 nodeA->aabb.mergeTwoAABBs(nodeC->aabb, nodeG->aabb); in balanceSubTreeAtNode()
544 nodeB->aabb.mergeTwoAABBs(nodeA->aabb, nodeF->aabb); in balanceSubTreeAtNode()
558 nodeA->aabb.mergeTwoAABBs(nodeC->aabb, nodeF->aabb); in balanceSubTreeAtNode()
559 nodeB->aabb.mergeTwoAABBs(nodeA->aabb, nodeG->aabb); in balanceSubTreeAtNode()
[all …]
/dports/games/alienarena-data/alienarena-7.66/source/unix/odesrc/
H A Dcollision_space.cpp424 dxAABB *aabb; in collide() local
498 for (aabb=first_aabb; aabb; aabb=aabb->next) { in collide()
510 node->aabb = aabb; in collide()
524 for (aabb=first_aabb; aabb; aabb=aabb->next) { in collide()
537 if (node->aabb == aabb) continue; in collide()
543 if (aabb->index <= node->aabb->index) { in collide()
544 i = (aabb->index * tested_rowsize)+(node->aabb->index >> 3); in collide()
548 i = (node->aabb->index * tested_rowsize)+(aabb->index >> 3); in collide()
553 collideAABBs (aabb->geom,node->aabb->geom,data,callback); in collide()
569 for (aabb=first_aabb; aabb; aabb=aabb->next) { in collide()
[all …]
/dports/games/alienarena/alienarena-7.66/source/unix/odesrc/
H A Dcollision_space.cpp424 dxAABB *aabb; in collide() local
498 for (aabb=first_aabb; aabb; aabb=aabb->next) { in collide()
510 node->aabb = aabb; in collide()
524 for (aabb=first_aabb; aabb; aabb=aabb->next) { in collide()
537 if (node->aabb == aabb) continue; in collide()
543 if (aabb->index <= node->aabb->index) { in collide()
544 i = (aabb->index * tested_rowsize)+(node->aabb->index >> 3); in collide()
548 i = (node->aabb->index * tested_rowsize)+(aabb->index >> 3); in collide()
553 collideAABBs (aabb->geom,node->aabb->geom,data,callback); in collide()
569 for (aabb=first_aabb; aabb; aabb=aabb->next) { in collide()
[all …]

12345678910>>...69