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

SAT, something is wrong I just don't know what....

1 post in this topic

I have implement this algorithm numerous times before, and it worked flawlessly everytime, right this is giving me trouble, and after rewritting this 3 times already I give up trying to find the error, maybe a set of new eyes can pinpoint it to me?

My problem is that it is detecting collisions where it shouldn't, and I can't seem to find out why.

 

 

public static class SAT
    {

        public class MTV
        {
            public Vector2 Axis;
            public float Magnitude;
            public bool Collided = true;
        }

        public static Vector2[] GetAxes(Vertices vert)
        {
            Vector2[] axes = new Vector2[vert.Count];
            // loop over the vertices
            for (int i = 0; i < vert.Count; i++)
            {
                // get the current vertex
                Vector2 p1 = vert[i];
                // get the next vertex
                Vector2 p2 = vert[vert.NextIndex(i)];
                // subtract the two to get the edge vector
                Vector2 edge = p1 - (p2);
                // get either perpendicular vector
                Vector2 normal = new Vector2(edge.Y, -edge.X);
                // the perp method is just (x, y) => (-y, x) or (y, -x)
                axes[i] = normal;
                axes[i].Normalize();
            }
            return axes;
        }


        public static MTV CheckCollision(Vertices polygon1,Vertices polygon2)
        {
            float overlap = float.PositiveInfinity;// really large value;
            MTV MTV = new SAT.MTV();
            MTV.Collided = false;
            Vector2 smallest = Vector2.Zero;
            Vector2[] axes1 = GetAxes(polygon1);
            Vector2[] axes2 = GetAxes(polygon2);
            // loop over the axes1
            for (int i = 0; i < axes1.Length; i++)
            {
                Vector2 axis = axes2[i];
                float min, max, min2, max2;
                // project both shapes onto the axis
                polygon1.ProjectToAxis(ref axis, out min, out max);
                polygon2.ProjectToAxis(ref axis, out min2, out max2);
                // do the projections overlap?
                float d1, d2;
                d1 = min - max2;
                d2 = min2 - max;
                if (d1 > 0 || d2 > 0) //no intersection
                {
                    // then we can guarantee that the shapes do not overlap
                    return MTV;
                }
                else
                {
                    // get the overlap
                    float o = d1 - d2;
                    // check for minimum
                    if (o < overlap)
                    {
                        // then set this one as the smallest
                        overlap = o;
                        smallest = axis;
                    }
                }
            }
            // loop over the axes2
            for (int i = 0; i < axes2.Length; i++)
            {
                Vector2 axis = axes2[i];
                float min, max, min2, max2;
                // project both shapes onto the axis
                polygon1.ProjectToAxis(ref axis,out min, out max );
                polygon2.ProjectToAxis(ref axis, out min2, out max2);
                // do the projections overlap?
                float d1, d2;
                d1 = min - max2;
                d2 = min2 - max;
                if ( d1 > 0 || d2 > 0 ) //no intersection
                {
                    // then we can guarantee that the shapes do not overlap
                    return MTV;
                }
                else
                {
                    // get the overlap
                    float o = d1 - d2;
                    // check for minimum
                    if (o < overlap)
                    {
                        // then set this one as the smallest
                        overlap = o;
                        smallest = axis;
                    }
                }
            }
            MTV.Collided = true;
            MTV.Axis = smallest;
            MTV.Magnitude = overlap;

            return MTV;


        }
    }

 

 

If anyone asked here is the Project to Axis from Vertices( its just List) :

 

public void ProjectToAxis(ref Vector2 axis, out float min, out float max)        {            // To project a point on an axis use the dot product            float dotProduct = Vector2.Dot(axis, this[0]);            min = dotProduct;            max = dotProduct;             for (int i = 0; i < Count; i++)            {                dotProduct = Vector2.Dot(this[i], axis);                if (dotProduct < min)                {                    min = dotProduct;                }                else                {                    if (dotProduct > max)                    {                        max = dotProduct;                    }                }            }        }

 

 

 

0

Share this post


Link to post
Share on other sites
EDIT2:
Completly fixed the code, due to my stupid mistake with a variable name. Edited by Morphex
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