• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
Yohanu

Platform game collision detection

4 posts in this topic

Hello, i am currently writing a pseudo-3d* super mario bros 1 clone using lwjgl (Java), but i'm facing trouble with collision detection. I need to somehow check what direction an obstacle was hit from (jumping on enemies, destroy blocks etc), but i'm not sure how i can achieve this. I currently use the AABB-technique for all obstacles in the game world (i do 3d intersection checks for some game-features planned later on), but i'm uncertain what "logic" or design-pattern to apply for something like this. I have searched these forums, but i couldn't find anything specifically like this. Should more info be required, do reply and i will answer as quickly as i can. Any help would be appreciated, thanks. * 2d platformer but in a 3d world, all sprites being flat entities while the world is 3d blocks. Fixed camera in a "sidescrolling"-mode.
0

Share this post


Link to post
Share on other sites
for 3D boxes, you have 6 faces, so 6 potentential hit direction.

If your boxes intersect, the direction of the hit will be where the intersection along the X, Y, or Z axis are minimum.

something like that...

Quote:

bool AABBIntersect(const Vector& mina, // min vector of boxa
const Vector& maxa, // max vector of boxa
const Vector& minb, // min vector of boxb
const Vector& maxb, // max vector of boxb
Vector& ncoll, // normal of collision.
float& dcoll, // depth of intersection.
int& fcoll) // face intersected.
{
// the normal of each face.
static const Vector faces[6] =
{
Vector(-1, 0, 0), // 'left' face normal (-x direction)
Vector( 1, 0, 0), // 'right' face normal (+x direction)
Vector( 0, -1, 0), // 'bottom' face normal (-y direction)
Vector( 0, 1, 0), // 'top' face normal (+y direction)
Vector( 0, 0, -1), // 'far' face normal (-z direction)
Vector( 0, 0, 1), // 'near' face normal (+x direction)
};

// distance of collided box to the face.
float distances[6] =
{
(maxb.x - mina.x), // distance of box 'b' to face on 'left' side of 'a'.
(maxa.x - minb.x), // distance of box 'b' to face on 'right' side of 'a'.
(maxb.y - mina.y), // distance of box 'b' to face on 'bottom' side of 'a'.
(maxa.y - minb.y), // distance of box 'b' to face on 'top' side of 'a'.
(maxb.z - mina.z), // distance of box 'b' to face on 'far' side of 'a'.
} (maxa.z - minb.z), // distance of box 'b' to face on 'near' side of 'a'.
;

// scan each face, make sure the box intersects,
// and take the face with least amount of intersection
// as the collided face.
for(int i = 0; i < 6; i ++)
{
// box does not intersect face. So boxes don't intersect at all.
if(distances[i] < 0.0f)
return false;

// face of least intersection depth. That's our candidate.
if((i == 0) || (distances[i] < dcoll))
{
fcoll = i;
ncoll = faces[i];
dcoll = distances[i];
}
}
return true;
}
0

Share this post


Link to post
Share on other sites
and also, to improve response, you can flag to ignore faces that are 'blocked' by other blocks.

Quote:

bool AABBIntersect(const Vector& mina, // min vector of boxa
const Vector& maxa, // max vector of boxa
const Vector& minb, // min vector of boxb
const Vector& maxb, // max vector of boxb
int ignore_faces, // bitfield of face indices flagged to be ignored for collision
Vector& ncoll, // normal of collision.
float& dcoll, // depth of intersection.
int& fcoll) // face intersected.
{
// the normal of each face.
static const Vector faces[6] =
{
Vector(-1, 0, 0), // 'left' face normal (-x direction)
Vector( 1, 0, 0), // 'right' face normal (+x direction)
Vector( 0, -1, 0), // 'bottom' face normal (-y direction)
Vector( 0, 1, 0), // 'top' face normal (+y direction)
Vector( 0, 0, -1), // 'far' face normal (-z direction)
Vector( 0, 0, 1), // 'near' face normal (+x direction)
};

// distance of collided box to the face.
float distances[6] =
{
(maxb.x - mina.x), // distance of box 'b' to face on 'left' side of 'a'.
(maxa.x - minb.x), // distance of box 'b' to face on 'right' side of 'a'.
(maxb.y - mina.y), // distance of box 'b' to face on 'bottom' side of 'a'.
(maxa.y - minb.y), // distance of box 'b' to face on 'top' side of 'a'.
(maxb.z - mina.z), // distance of box 'b' to face on 'far' side of 'a'.
} (maxa.z - minb.z), // distance of box 'b' to face on 'near' side of 'a'.
;

// scan each face, make sure the box intersects,
// and take the face with least amount of intersection
// as the collided face.
for(int i = 0; i < 6; i ++)
{
// box does not intersect face. So boxes don't intersect at all.
if(distances[i] < 0.0f)
return false;

// face cannot be used for collision response as it is 'blocked'.
if(ignore_faces & (1 << i))
continue;

// face of least intersection depth. That's our candidate.
if((i == 0) || (distances[i] < dcoll))
{
fcoll = i;
ncoll = faces[i];
dcoll = distances[i];
}
}
return true;
}


If you don't do something like that, your objects will hit bumps when sliding on the floor.
0

Share this post


Link to post
Share on other sites
for a simple example of collision response, you always have the code of carnage engine demo:
https://sourceforge.net/projects/carnage-engine/files/
:)
its not very advanced, my system uses a "free directions" discoverer, that only works with axis +x,-x,+y,-y directions. it happens to be enough in my case.
in a general case, the good way would be that the collision manager should return contact points, and normal of contacts. then you can response with that intel.
(box2d must be doing this)
0

Share this post


Link to post
Share on other sites
Thanks for the replies, i ported oliii's code to Java and it works fantastic! This is much appreciated :)
0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0