Java-Gaming.org
Play Revenge of the Titans! The situation is critical. We need fancy commanders to defend Earth, the moon, Mars!
Featured games (78)
games approved by the League of Dukes
Games in Showcase (408)
games submitted by our members
Games in WIP (293)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
 
    Home     Help   Search   Login   Register   
Pages: [1]
  ignore  |  Print  
  SAT collision detection and calculating MTV - slick2d  (Read 393 times)
0 Members and 1 Guest are viewing this topic.
Offline sun

JGO Visitor




« Posted 2012-07-15 17:19:34 »

Hi, I'm currently implementing SAT collision detection for my game using SAT, which correctly returns true when there is a collision and false when there is isn't. However, I want to extend the code to return the MTV but I'm having difficulties trying to return the correct value. Below is the code:

1  
2  
3  
4  
5  
6  
7  
8  
9  
10  
11  
12  
13  
14  
15  
16  
17  
18  
19  
20  
21  
22  
23  
24  
25  
26  
27  
28  
29  
30  
31  
32  
33  
34  
35  
36  
37  
38  
39  
40  
41  
42  
43  
44  
45  
46  
47  
48  
49  
50  
51  
52  
53  
   
   ArrayList<Vector2f> playerV = new ArrayList<Vector2f>();
   ArrayList<Vector2f> shape2V = new ArrayList<Vector2f>();

    float playerMin = 0;
    float playerMax = playerMin;
     
    float shapeMin = 0;
    float shapeMax = shapeMin;
    Vector2f shapeNormal = new Vector2f(0,0);  
   
   for(int j = playerV.size()-1, i = 0; i < playerV.size(); j = i, i++){
     
      Vector2f playerCorner1 = new Vector2f(playerV.get(j));
      Vector2f playerCorner2 = new Vector2f(playerV.get(i));
     
      Vector2f shapeCorner1 = new Vector2f(shape2V.get(j));
      Vector2f shapeCorner2 = new Vector2f(shape2V.get(i));
           
      Vector2f playerNormal = new Vector2f (playerCorner2.sub(playerCorner1).getPerpendicular().normalise());
     
      playerMin = playerV.get(0).dot(playerNormal);
      playerMax = playerMin;
     
         for(int v = 0; v < playerV.size(); v++){
               float dot = playerV.get(v).dot(playerNormal);
            if(dot < playerMin){
               playerMin = dot;
            }else if(dot > playerMax){
               playerMax = dot;
            }      
          }
     
          for(int u = 0; u < shape2V.size(); u++){
               float dot = shape2V.get(u).dot(playerNormal);
            if(dot < shapeMin){
               shapeMin = dot;
            }else if(dot > shapeMax){
               shapeMax = dot;
               }      
           }
               
            if(playerMin > shapeMax ||   shapeMin >  playerMax){
               return false;
            }else{
                                copyaxis = playerNormal;
                                }
   }
       
         mtv.set((shapeMax-playerMin) *-copyaxis.x ,(shapeMax-playerMin)*-copyaxis.y);
    return true;
   
   }


What would be the best way to calculate the MTV? This was the recourse that I had used http://rocketmandevelopment.com/2010/05/19/separation-of-axis-theorem-for-collision-detection/ , but the method used to calculate the MTV is giving odd results. The mtv returned with the method described in the article always returns  a 0 value for the x part of the mtv, for example: (0.0,59.0). This does make sense since the normalized vector for the axis being tested is something like (0,1) on collision.
Pages: [1]
  ignore  |  Print  
 
 
You cannot reply to this message, because it is very, very old.

Play Revenge of the Titans! The situation is critical. We need fancy commanders to defend Earth, the moon, Mars!
 
Get high quality music tracks for your game!

Add your game by posting it in the WIP section,
or publish it in Showcase.

The first screenshot will be displayed as a thumbnail.

The invasion has landed! On Mars! And you're there to beat 'em!
cubemaster21 (140 views)
2013-05-17 21:29:12

alaslipknot (149 views)
2013-05-16 21:24:48

gouessej (180 views)
2013-05-16 00:53:38

gouessej (173 views)
2013-05-16 00:17:58

theagentd (183 views)
2013-05-15 15:01:13

theagentd (168 views)
2013-05-15 15:00:54

StreetDoggy (212 views)
2013-05-14 15:56:26

kutucuk (236 views)
2013-05-12 17:10:36

kutucuk (235 views)
2013-05-12 15:36:09

UnluckyDevil (240 views)
2013-05-12 05:09:57
Complex number cookbook
by Roquen
2013-04-24 12:47:31

2D Dynamic Lighting
by Oskuro
2013-04-17 16:46:12

2D Dynamic Lighting
by Oskuro
2013-04-17 16:45:57

2D Dynamic Lighting
by Oskuro
2013-04-17 16:23:20

Noise (bandpassed white)
by Roquen
2013-04-05 17:36:01

Noise (bandpassed white)
by Roquen
2013-04-03 16:17:38

Java Data structures
by Roquen
2013-03-29 13:21:12

Topic Request
by kutucuk
2013-03-22 21:42:01
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!
Page created in 0.162 seconds with 20 queries.