| |
 |
|
| Computers Forum Index » Computer - Games Programming (Algorithms) » Collision detection... |
|
Page 1 of 1 |
|
| Author |
Message |
| ... |
 Posted: Tue Nov 11, 2008 11:03 am |
|
|
|
Guest
|
Hello,
I want to implenent a collision detection algorithm. All kinds id
polygons in 3D shall be testet.
The algorithm I think of is easy, but there is still something I do
not know...
The - well known - algorithm goes as follows
(1) calculate the Minkowski difference of the points of the 2 polygons
(easy)
(2) find out whethet the calculated points are lying th the same half
plane in 3D. (seems to be simple)
Now the problem is, that I cannot find an an algorithm regarding (2)
when searching the Internet. The angorithms I
would implement would be a bit "heuristic", in other words: not so
good.
Does anybody know a good algorithm for (2)?
Thanks in advance
ERik |
|
|
| Back to top |
|
|
|
| Gino van den Bergen... |
| Posted: Sun Nov 30, 2008 4:47 am |
|
|
|
Guest
|
Step (2) boils down to computing a separating axis for the polygons.
You'll find a lot of references on finding separating axes ranging from
the SAT (separating axes theorem) to GJK.
Gino van den Bergen
www.dtecta.com
qysocibixaminuxy at (no spam) tempomail.fr schreef:
Quote: Hello,
I want to implenent a collision detection algorithm. All kinds id
polygons in 3D shall be testet.
The algorithm I think of is easy, but there is still something I do
not know...
The - well known - algorithm goes as follows
(1) calculate the Minkowski difference of the points of the 2 polygons
(easy)
(2) find out whethet the calculated points are lying th the same half
plane in 3D. (seems to be simple)
Now the problem is, that I cannot find an an algorithm regarding (2)
when searching the Internet. The angorithms I
would implement would be a bit "heuristic", in other words: not so
good.
Does anybody know a good algorithm for (2)?
Thanks in advance
ERik
|
|
|
| Back to top |
|
|
|
|
|
All times are GMT
The time now is Sun Nov 22, 2009 2:06 am
|
|