Searched refs:aabb (Results 1 - 25 of 38) sorted by relevance

12

/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/dynamics/
H A DFixtureProxy.java34 final AABB aabb = new AABB(); field in class:FixtureProxy
H A DFixture.java301 return m_proxies[childIndex].aabb;
383 m_shape.computeAABB(proxy.aabb, xf, i);
384 proxy.proxyId = broadPhase.createProxy(proxy.aabb, proxy);
432 proxy.aabb.lowerBound.x =
434 proxy.aabb.lowerBound.y =
436 proxy.aabb.upperBound.x =
438 proxy.aabb.upperBound.y =
443 broadPhase.moveProxy(proxy.proxyId, proxy.aabb, displacement);
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/
H A DDynamicTree.java79 public final int createProxy(final AABB aabb, Object userData) { argument
80 assert(aabb.isValid());
83 // Fatten the aabb
84 final AABB nodeAABB = node.aabb;
85 nodeAABB.lowerBound.x = aabb.lowerBound.x - Settings.aabbExtension;
86 nodeAABB.lowerBound.y = aabb.lowerBound.y - Settings.aabbExtension;
87 nodeAABB.upperBound.x = aabb.upperBound.x + Settings.aabbExtension;
88 nodeAABB.upperBound.y = aabb.upperBound.y + Settings.aabbExtension;
107 public final boolean moveProxy(int proxyId, final AABB aabb, Vec2 displacement) { argument
108 assert(aabb
162 query(TreeCallback callback, AABB aabb) argument
193 private final AABB aabb = new AABB(); field in class:DynamicTree
[all...]
H A DBroadPhase.java19 * @param aabb
23 int createProxy(AABB aabb, Object userData); argument
36 void moveProxy(int proxyId, AABB aabb, Vec2 displacement); argument
67 * @param aabb
69 void query(TreeCallback callback, AABB aabb); argument
H A DBroadPhaseStrategy.java15 * @param aabb
19 int createProxy(AABB aabb, Object userData); argument
34 boolean moveProxy(int proxyId, AABB aabb, Vec2 displacement); argument
47 void query(TreeCallback callback, AABB aabb); argument
H A DDynamicTreeNode.java32 public final AABB aabb = new AABB(); field in class:DynamicTreeNode
H A DDefaultBroadPhaseBuffer.java78 public final int createProxy(final AABB aabb, Object userData) { argument
79 int proxyId = m_tree.createProxy(aabb, userData);
93 public final void moveProxy(int proxyId, final AABB aabb, final Vec2 displacement) { argument
94 boolean buffer = m_tree.moveProxy(proxyId, aabb, displacement);
117 // return AABB.testOverlap(proxyA.aabb, proxyB.aabb);
159 // log.debug("quering aabb: "+m_queryProxy.aabb);
193 public final void query(final TreeCallback callback, final AABB aabb) { argument
194 m_tree.query(callback, aabb);
[all...]
H A DDynamicTreeFlatNodes.java88 public final int createProxy(final AABB aabb, Object userData) { argument
90 // Fatten the aabb
92 nodeAABB.lowerBound.x = aabb.lowerBound.x - Settings.aabbExtension;
93 nodeAABB.lowerBound.y = aabb.lowerBound.y - Settings.aabbExtension;
94 nodeAABB.upperBound.x = aabb.upperBound.x + Settings.aabbExtension;
95 nodeAABB.upperBound.y = aabb.upperBound.y + Settings.aabbExtension;
113 public final boolean moveProxy(int proxyId, final AABB aabb, Vec2 displacement) { argument
119 // if (nodeAABB.contains(aabb)) {
120 if (nodeAABB.lowerBound.x <= aabb.lowerBound.x && nodeAABB.lowerBound.y <= aabb
170 query(TreeCallback callback, AABB aabb) argument
200 private final AABB aabb = new AABB(); field in class:DynamicTreeFlatNodes
[all...]
/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
H A Db2DynamicTree.cpp108 int32 b2DynamicTree::CreateProxy(const b2AABB& aabb, void* userData) argument
112 // Fatten the aabb.
114 m_nodes[proxyId].aabb.lowerBound = aabb.lowerBound - r;
115 m_nodes[proxyId].aabb.upperBound = aabb.upperBound + r;
133 bool b2DynamicTree::MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement) argument
139 if (m_nodes[proxyId].aabb.Contains(aabb))
147 b2AABB b = aabb;
214 b2AABB aabb; local
220 b2AABB aabb; local
231 b2AABB aabb; local
237 b2AABB aabb; local
646 b2AABB aabb; local
[all...]
H A Db2BroadPhase.cpp42 int32 b2BroadPhase::CreateProxy(const b2AABB& aabb, void* userData) argument
44 int32 proxyId = m_tree.CreateProxy(aabb, userData);
57 void b2BroadPhase::MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement) argument
59 bool buffer = m_tree.MoveProxy(proxyId, aabb, displacement);
H A Db2DynamicTree.h36 b2AABB aabb; member in struct:b2TreeNode
71 int32 CreateProxy(const b2AABB& aabb, void* userData);
92 void Query(T* callback, const b2AABB& aabb) const;
165 return m_nodes[proxyId].aabb;
169 inline void b2DynamicTree::Query(T* callback, const b2AABB& aabb) const
184 if (b2TestOverlap(node->aabb, aabb))
242 if (b2TestOverlap(node->aabb, segmentAABB) == false)
249 b2Vec2 c = node->aabb.GetCenter();
250 b2Vec2 h = node->aabb
[all...]
H A Db2Collision.h188 void Combine(const b2AABB& aabb) argument
190 lowerBound = b2Min(lowerBound, aabb.lowerBound);
191 upperBound = b2Max(upperBound, aabb.upperBound);
201 /// Does this aabb contain the provided AABB.
202 bool Contains(const b2AABB& aabb) const
205 result = result && lowerBound.x <= aabb.lowerBound.x;
206 result = result && lowerBound.y <= aabb.lowerBound.y;
207 result = result && aabb.upperBound.x <= upperBound.x;
208 result = result && aabb.upperBound.y <= upperBound.y;
H A Db2BroadPhase.h51 int32 CreateProxy(const b2AABB& aabb, void* userData);
58 void MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement);
82 void Query(T* callback, const b2AABB& aabb) const;
274 inline void b2BroadPhase::Query(T* callback, const b2AABB& aabb) const
276 m_tree.Query(callback, aabb);
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/
H A DAABB.java70 * @param aabb the object to copy from
72 public final void set(final AABB aabb) { argument
73 Vec2 v = aabb.lowerBound;
76 Vec2 v1 = aabb.upperBound;
160 * Combines another aabb with this one
162 * @param aabb
164 public final void combine(final AABB aabb) { argument
165 lowerBound.x = lowerBound.x < aabb.lowerBound.x ? lowerBound.x : aabb.lowerBound.x;
166 lowerBound.y = lowerBound.y < aabb
176 contains(final AABB aabb) argument
[all...]
/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/Shapes/
H A Db2CircleShape.cpp84 void b2CircleShape::ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const argument
89 aabb->lowerBound.Set(p.x - m_radius, p.y - m_radius);
90 aabb->upperBound.Set(p.x + m_radius, p.y + m_radius);
H A Db2EdgeShape.cpp117 void b2EdgeShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const argument
128 aabb->lowerBound = lower - r;
129 aabb->upperBound = upper + r;
H A Db2EdgeShape.h49 void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;
H A Db2Shape.h81 /// @param aabb returns the axis aligned box.
84 virtual void ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const = 0;
H A Db2ChainShape.cpp169 void b2ChainShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const
183 aabb->lowerBound = b2Min(v1, v2);
184 aabb->upperBound = b2Max(v1, v2);
H A Db2ChainShape.h79 void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;
H A Db2CircleShape.h44 void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;
H A Db2PolygonShape.h66 void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/shapes/
H A DShape.java109 public abstract void computeAABB(final AABB aabb, final Transform xf, int childIndex); argument
H A DCircleShape.java183 public final void computeAABB(final AABB aabb, final Transform transform, int childIndex) { argument
189 aabb.lowerBound.x = px - m_radius;
190 aabb.lowerBound.y = py - m_radius;
191 aabb.upperBound.x = px + m_radius;
192 aabb.upperBound.y = py + m_radius;
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
H A DbtDbvtBroadphase.cpp174 btDbvtAabbMm aabb = btDbvtVolume::FromMM(aabbMin,aabbMax); local
176 //bproxy->aabb = btDbvtVolume::FromMM(aabbMin,aabbMax);
179 proxy->leaf = m_sets[0].insert(aabb,proxy);
185 m_sets[0].collideTV(m_sets[0].m_root,aabb,collider);
186 m_sets[1].collideTV(m_sets[1].m_root,aabb,collider);
288 ATTRIBUTE_ALIGNED16(btDbvtVolume) aabb=btDbvtVolume::FromMM(aabbMin,aabbMax);
290 if(NotEqual(aabb,proxy->leaf->volume))
297 proxy->leaf=m_sets[0].insert(aabb,proxy);
303 if(Intersect(proxy->leaf->volume,aabb))
313 m_sets[0].update(proxy->leaf,aabb,velocit
[all...]

Completed in 455 milliseconds

12