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 (416)
games submitted by our members
Games in WIP (307)
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  
  Simple Polygon Collision and (!) getting the intersection area  (Read 347 times)
0 Members and 1 Guest are viewing this topic.
Offline greenOwl

Junior Member


Medals: 1


from Germany


« Posted 2013-03-07 21:58:06 »

Hello,

I know there a A LOT of collision threads and tutorials and what not, but after searching for ~1 hour I decided to create yet another thread:

I'm familiar with the SAT and (to same degree) PIP (Point in Polygon) algorithms and they're working fine, but I need additional information:
I need to know the "line" or set of vectors representing the intersection "cut" area:



I need either the red or the blue edge(part)s (depending on which polygon intersects which) as a set of vectors / lines. I know I can get the minimum translation vector via SAT but I can't come up with or find any ideas that give me what I want.

If someone has a link for me or can discribe how to get my intersection cut?
Thank you in advance!

elfeck
Offline Axeman

Senior Member


Medals: 4



« Reply #1 - Posted 2013-03-07 22:42:16 »

Here´s a link how to get the point of two intersecting lines (you have to scroll down a bit)

http://paulbourke.net/geometry/pointlineplane/

There´s even some source. Even though it´s not java it´s really easy to port. Hope it helps.

Pages: [1]
  ignore  |  Print  
 
 

Play Revenge of the Titans! The situation is critical. We need fancy commanders to defend Earth, the moon, Mars!
 
Play Revenge of the Titans! The situation is critical. We need fancy commanders to defend Earth, the moon, Mars and Titan!

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!
mrbenebob (19 views)
2013-06-19 14:55:23

BrassApparatus (29 views)
2013-06-19 08:52:37

NegativeZero (32 views)
2013-06-19 03:31:52

NegativeZero (34 views)
2013-06-19 03:24:09

Jesse_Attard (39 views)
2013-06-18 22:03:02

HeroesGraveDev (75 views)
2013-06-15 23:35:23

Vermeer (76 views)
2013-06-14 20:08:06

davedes (77 views)
2013-06-14 16:03:55

alaslipknot (69 views)
2013-06-13 07:56:31

Roquen (92 views)
2013-06-12 04:12:32
Smoothing Algorithm Question
by UprightPath
2013-05-28 02:58:26

Smoothing Algorithm Question
by UprightPath
2013-05-28 02:57:33

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
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!