i do not understand the contact solver when two contact point come in, why should we compute K-Matrix and what is maxCondition ? how does it work ? can you provide me an explanation or paper about that?
i commented that line and traced the value of right child in different situation, the value was only 'false' in all situation. if (n == n.parent.left) { // it is, so check if the right node is non-null //if (n.parent.right != null) { // System.out.println(n.parent.right == null); // it isn't so the ...
thank you for reply, i exactly know what the function do, my question is here : Why do you assume this situation(the image you have given, node 4 which has just one child) of tree ? How can a AABB tree, which is a Complete Tree be constructed like this? assume these objects: http://forum.dyn4j.org/d...
Hi, i took a look at dyn4j implementation of dynamic AABB tree, the DynamicAABBTree class, i am confused by this piece of code : while (n.parent != null) { // check if the current node the left child of its parent if (n == n.parent.left) { // it is, so check if the right node is non-null if (n.paren...
Hi, in line 186 of this code file : https://code.google.com/p/dyn4j/source/browse/tags/1.0.3/src/org/dyn4j/game2d/collision/broadphase/Sap.java it uses triangular matrix, why can't we use HashTable instead of that? i can't understand these lines : if (current.id > test.id) { matrix[test.id + (curren...