Java-Gaming.org Hi !
 Featured games (84) games approved by the League of Dukes Games in Showcase (570) Games in Android Showcase (154) games submitted by our members Games in WIP (618) games currently in development
 News: Read the Java Gaming Resources, or peek at the official Java tutorials
Pages: [1]
 ignore  |  Print
 Ideas? Need help with collision during rotation  (Read 1429 times) 0 Members and 1 Guest are viewing this topic.
barfy

Junior Devvie

The evidence of things not seen

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

Hi,

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: http://www.imagedump.com/index.cgi?pick=get&tp=49876&poll_id=0&a 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?    :-/

Thanks.
Pages: [1]
 ignore  |  Print

You cannot reply to this message, because it is very, very old.

 Riven (23 views) 2015-04-16 10:48:47 Duke0200 (36 views) 2015-04-16 01:59:01 Fairy Tailz (27 views) 2015-04-14 20:13:12 Riven (29 views) 2015-04-12 21:36:37 bus hotdog (46 views) 2015-04-10 02:39:32 CopyableCougar4 (48 views) 2015-04-10 00:51:04 BurntPizza (48 views) 2015-04-06 22:06:58 ags1 (51 views) 2015-04-02 10:58:48 Riven (49 views) 2015-04-01 18:27:05 ags1 (66 views) 2015-03-31 10:55:12
 BurntPizza 24x theagentd 21x wessles 15x 65K 12x Rayvolution 12x kingroka123 11x alwex 10x KevinWorkman 9x kevglass 8x ra4king 8x phu004 8x Hanksha 7x SHC 7x Olo 7x Ecumene 7x chrislo27 7x
 How to: JGO Wikiby Mac702015-02-17 20:56:162D Dynamic Lighting2015-01-01 20:25:42How do I start Java Game Development?by gouessej2014-12-27 19:41:21Resources for WIP gamesby kpars2014-12-18 10:26:14Understanding relations between setOrigin, setScale and setPosition in libGdx2014-10-09 22:35:00Definite guide to supporting multiple device resolutions on Android (2014)2014-10-02 22:36:02List of Learning Resources2014-08-16 10:40:00List of Learning Resources2014-08-05 19:33:27
 java-gaming.org 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‑gaming.org