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  
  Advice wanted about collsion detection  (Read 769 times)
0 Members and 1 Guest are viewing this topic.
Offline Daz

Senior Newbie




Java games rock!


« Posted 2004-11-17 09:49:25 »

Hi, i am creating a snooker game in java 2d at the moment, but i am not sure what collision detection strategy to use. Anyone got any ideas?
Offline Backmask

Junior Member




586: The average IQ needed to understand a PC


« Reply #1 - Posted 2004-11-17 09:56:45 »

Stop crossposting  Angry

Offline phazer

Junior Member




Come get some


« Reply #2 - Posted 2004-11-17 12:26:05 »

Last time I checked snooker balls were round, so 2D circular bounds would be good.

It's extremely easy to check the collision between two stationary circles.

If that's not accurate enough, it's quite easy to calculate the collision of one moving circle and one stationary. I hope you were awake on the linear algebra lessons.

If that is not accurate enough for you, you can come up with an equation that calculates the collision of two moving circles. Just find the solution for t in:

1  
2  
3  
4  
5  
6  
7  
8  
9  
|(p1 + t*v1) - (p2 + t*v2)| = 2*r

where:

p1 = the position of ball 1
v1 = the velocity vector of ball 1
p2 = the position of ball 2
v2 = the velocity vector of ball 2
r = the ball radius


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 (84 views)
2013-05-17 21:29:12

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

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

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

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

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

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

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

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

UnluckyDevil (187 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.098 seconds with 20 queries.