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 (406)
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  
  [SOLVED] Using distance formula for collision detection?  (Read 460 times)
0 Members and 1 Guest are viewing this topic.
Offline wreed12345
« Posted 2012-11-28 00:38:09 »

WOuld it be effective to use the distance formula to test for collision detection between two moving images (characters)? or is there some other more efficient method. I figured this wouldnt be too hard to implement
Offline Agro
« Reply #1 - Posted 2012-11-28 00:42:13 »

Assuming your image is a square, no. You could use the AABB method I guess but if its 2 squares you can do it like this:

1  
2  
3  
4  
5  
6  
7  
8  
public boolean collides(Rect a, Rect b) {
    if(a.x < b.x + b.width) return true;
    if(a.y < b.y + b.height) return true;
    if(a.x + a.width > b.x) return true;
    if(a.y + a.height > b.y) return true;

    return false;
}


However, if your characters are circles, then yes. You can use the distance formula and check if the distance returned is less than the radius of both circles added together. Then there is a collision.

Offline wreed12345
« Reply #2 - Posted 2012-11-28 01:05:01 »

Well the game i had in mind was a circle colliding with a square image. What do you think would be best for that?
Games published by our own members! Check 'em out!
Play the free demo of Revenge of the Titans!
Offline Agro
« Reply #3 - Posted 2012-11-28 01:06:15 »

Yeah, use AABB: http://www.java-gaming.org/topics/basic-collision-detection/27326/view.html

He explains it in the best possible way ^_^

Offline wreed12345
« Reply #4 - Posted 2012-11-28 01:12:51 »

thanks for the help!
Offline theagentd
« Reply #5 - Posted 2012-11-28 15:15:01 »

Assuming your image is a square, no. You could use the AABB method I guess but if its 2 squares you can do it like this:

1  
2  
3  
4  
5  
6  
7  
8  
public boolean collides(Rect a, Rect b) {
    if(a.x < b.x + b.width) return true;
    if(a.y < b.y + b.height) return true;
    if(a.x + a.width > b.x) return true;
    if(a.y + a.height > b.y) return true;

    return false;
}


However, if your characters are circles, then yes. You can use the distance formula and check if the distance returned is less than the radius of both circles added together. Then there is a collision.
A circle to circle test isn't expensive either...

1  
2  
3  
4  
5  
public boolean collides(Circle a, Circle b) {
    float dx = a.x - b.x, dy = a.y - b.y;
    float dist = a.radius + b.radius;
    return dx*dx + dy*dy < dist*dist;
}

Myomyomyo.
Pages: [1]
  ignore  |  Print  
 
 

Play Revenge of the Titans! The situation is critical. We need fancy commanders to defend Earth, the moon, Mars!
 
Browse for soundtracks 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 (76 views)
2013-05-17 21:29:12

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

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

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

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

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

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

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

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

UnluckyDevil (185 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.127 seconds with 21 queries.