Hi !
Featured games (85)
games approved by the League of Dukes
Games in Showcase (636)
Games in Android Showcase (178)
games submitted by our members
Games in WIP (688)
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  
  Ideas? Need help with collision during rotation  (Read 1523 times)
0 Members and 1 Guest are viewing this topic.
Offline barfy

Junior Devvie

The evidence of things not seen

« Posted 2004-03-13 04:47:30 »


I would really appreciate any help and ideas from all you Java gods with regards to the following 2D problem:

1. How do I detect AND recover from a collision between arbitrary polygons (convex or concave with more than 3 vertices) in 2D rotating and moving directionally at different speeds?

I was thinking of checking each line segment generated from each BEFORE MOVING vertex of polygon A to the AFTER MOVING vertex, against all the edges of the polygon B. The process is then repeated for polygon B "moving" in the opposite direction. Very brute-force I know, but at least it solves the speed problem with collision detection.

I've linked a pic to illustrate: mp;warned=y

In the picture, the red line segments generated from the movement are checked against the blue edges of the green polygon. The red circles represent the point of intersections.  

1. To detect collision during DIRECTION MOVEMENT at arbitrary speeds, i find the before and after coordinates and use the above algorithm. To correct the movement, I find the point of intersection with the least displacement from the original vertex and translate the polygon there instead.

2. To detect collision during ROTATION at arbitrary speeds, i would use the exact same process, with the exception that line segments are now rotation arcs.  

My big and ugly problem is that I can't find a neat and (somewhat) efficient algorithm to compute the angle I must "un-rotate" to get the correct displacement. Since I'm hardly a mathematician, the algorithm I have, in a word, sucks.

Can anyone help with the algorithm? Is this even a good way to get around the problem?    :-/

Pages: [1]
  ignore  |  Print  
You cannot reply to this message, because it is very, very old.

Dwinin (73 views)
2015-11-07 13:29:08

Rems19 (81 views)
2015-10-31 01:36:56

Rems19 (79 views)
2015-10-31 01:32:37

williamwoles (107 views)
2015-10-23 10:42:59

williamwoles (93 views)
2015-10-23 10:42:45

Jervac_ (111 views)
2015-10-18 23:29:12

DarkCart (135 views)
2015-10-16 00:58:11

KaiHH (118 views)
2015-10-11 14:10:14

KaiHH (158 views)
2015-10-11 13:26:18

BurntPizza (172 views)
2015-10-08 03:11:46
Rendering resources
by Roquen
2015-11-13 14:37:59

Rendering resources
by Roquen
2015-11-13 14:36:58

Math: Resources
by Roquen
2015-10-22 07:46:10

Networking Resources
by Roquen
2015-10-16 07:12:30

Rendering resources
by Roquen
2015-10-15 07:40:48

Math: Inequality properties
by Roquen
2015-10-01 13:30:46

Math: Inequality properties
by Roquen
2015-09-30 16:06:05

HotSpot Options
by Roquen
2015-08-29 11:33:11 is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑
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!