• 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
superman3275

Just finished my Circular Collision Function!

6 posts in this topic

Hello all! I have spent today working on a good set of functions to test collision in my game (I'm expecting to finish my character tomorrow) and I'm very happy! The method I used was finding the distance betweent the circles (I used the pythagoreon theorem!) and then seeing if the distance was less than either circles radius. It doesn't work for ovals (Only perfect circles), however the circles can have different diameters. Do you know how I can check collision for Ovals also? I've been thinking through the problem all day, however I've had no luck. Cheers :)!

0

Share this post


Link to post
Share on other sites

google search for ellipse's intersection would give you what you need.

 

basically, all you have to do is find the point on the ellipse closest to the other ellipse(or circle), and it becomes simple distance checks.

 

 

bool EllipseIntersection(float axRadius, float ayRadius, float ax, float ay, float bxRadius, float byRadius, float bx, float by){
 //Get direction+distance toward b
 float cx = bx-ax;
 float cy = by-ay;
 float cSqrt = sqrtf(cx*cx+cy*cy); //Check for 0
 if(cSqrt <=0.0001f) return true; //they are ontop of each other.
 //Normalize c:
 float cnx = cx/cSqrt;
 float cny = cy/cSqrt;
 //Find a's ellipse point toward b:
 float aex = axRadius*cnx;
 float aey = ayRadius*cny;
 float aeSqrt = sqrtf(aex*aex+aey*aey); //Get distance to that point.
 //Find b's ellipse point toward a:
 float bex = bxRadius*-cnx;
 float bey = byRadius*-cny;
 float beSqrt = sqrtf(bex*bex+bey*bey); //" "
 return cSqrt<=aeSqrt+beSqrt;
}

 

 

someone correct me if i did something wrong, i wrote that up just now from memory of the last time i wrote an ellipse-ellipse collision function.

 

edit: tested and fixed an issue, i thought i could test without taking the sqrt, but that's only with circles.

Edited by slicer4ever
0

Share this post


Link to post
Share on other sites
When using Pythagoras for collision detection you can cut the cpu cost from the sqrt by doing the comparison in the second dimension. In other words, rather than using sqrt on (a^2 + b^2) and then comparing it to (c) just compare (a^2 + b^2) to (c^2). Squaring is much cheaper than sqrt'ing and you'll get the same relationship for &lt;, &gt;, and ==.<br /><br />Is that what you were mentioning, slicer? I see your edit there.
0

Share this post


Link to post
Share on other sites

Note: the above collision code will only work for axis-aligned ellipses. If either ellipse can rotate, the collision test will not work correctly.

0

Share this post


Link to post
Share on other sites
Not only that, it involves solving a quartic (degree 4) equation I believe, which is not a nice thing to have to solve analytically.
0

Share this post


Link to post
Share on other sites
From instinct I'd think that you'd need to calculate the radius along the vector from centerpoint-to-nearestpoint and then just handle it like circle collision.

This is intriguing. How would you store the collider? I'm thinking a centerpoint x/y vector, a width and height and then an angle of rotation... So to find the radius for a given angle you'd subtract the angle of rotation from it (to axis-align the calculation) then...

Hmm...

I think you could apply slicer's equation at that point, though you'd have to also adjust for rotation with the other ellipse if you're doing ellipse-vs-ellipse testing.

I don't know if there would be a good way of reducing the complexity in this case, so you'd definitely want to do a broad-phase test before getting into the heavy math.

Some related links I found:
http://www.gamedev.net/topic/309198-aabb-for-an-ellipse/
http://www.gamedev.net/page/resources/_/technical/game-programming/general-collision-detection-for-games-using-ell-r1026 Edited by Khatharr
0

Share this post


Link to post
Share on other sites
When using Pythagoras for collision detection you can cut the cpu cost from the sqrt by doing the comparison in the second dimension. In other words, rather than using sqrt on (a^2 + b^2) and then comparing it to (c) just compare (a^2 + b^2) to (c^2). Squaring is much cheaper than sqrt'ing and you'll get the same relationship for &lt;, &gt;, and ==.<br /><br />Is that what you were mentioning, slicer? I see your edit there.

yes, i first took the Sq's, but when i was doing a test on the code to check that it was working i realized that i couldn't do that.

 

for example:

ellipse A: x = 0, y = 0, xRad = 5.0f, yRad = 5.0

ellipse B: x = 10, y = 0, xRad = 5.0f, yRad = 5.0

(essentially two circles)

so, their distance squared would be 100

but each radius squared would be 25, and their total is 50, while the two circles are touching, the sq's don't reflect that, however the sqrt's do.

 

and yes, that code's only for axis-aligned ellipse's.

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