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

Can't properly fill my polygon

4 posts in this topic

I generate a polygon inside a map. Every point corresponds to an integer value. My current filling algorithm works for most polygons, but as soon as I get convex polygons it has problems :

 

fuck_zps1c560e0a.png

 

Both problems are pretty obvious when looking at the picture, sometimes it fills the exterior the only reason that this doesn't happen all the time is because I check to see if the next fill is even(It's always supposed to be even since fills are done by region, ie 0 then 2 then 4.)

 

The other problem is that since I draw pairs of points, since I treat consecutive rows of 1's as one point the next segment is ignored since there's only one point left.

 

Here's the filling code :

 

void PolygonGenerator::fillInside(std::vector< std::vector<int> > &vec, std::vector<CoordinateXY> &vertices)
{
    for(unsigned int i = 0; i < vec.size(); i++)
    {
        std::vector<int> pointCoords = countOnALine(vec[i], i, coordinates);

        if(pointCoords.size() <= 1) continue;

        for(unsigned int j = 0; j < pointCoords.size(); j+=2)
        {
            int pt1 = pointCoords[j];
            int pt2 = pointCoords[j+1];

            while(pt1 <= pt2)
            {
                if(j % 2 == 0)
                    vec[i][pt1] = 1;
                pt1++;
            }

        }
    }
}

std::vector<int> PolygonGenerator::countOnALine(const std::vector<int> &vec, int lineIndex, std::vector<CoordinateXY> &vertices)
{
    std::vector<int> pointCoords;
    for(unsigned int i = 0; i < vec.size(); i++)
    {
        if( (i+1) >= vec.size()) continue;

        if(vec[i] == 1 && vec[i+1] == 0)
            pointCoords.push_back(i);
    }

    return pointCoords;
}

 

I hope the code is self-comprehensible. I don't use the vertices in the countOnALine method or the lineIndex. The method's purpose is simply to return non-consecutive coordinates of 1's.

 

I've spent too much time trying to figure this thing out, I'm done for today. I hope someone has a clue. I know of another method to fill polygon's, but it is pretty shitty.

Edited by Zilee
0

Share this post


Link to post
Share on other sites
The polygons where you are having trouble are not convex: They are concave. Since rasterizing arbitrary polygons is a tricky process, people usually restrict themselves to convex polygons, or even just triangles.
0

Share this post


Link to post
Share on other sites
The polygons where you are having trouble are not convex: They are concave. Since rasterizing arbitrary polygons is a tricky process, people usually restrict themselves to convex polygons, or even just triangles.

 

Yep sorry, concave. Ah well, I saw some algorithms that "seem" to get it done. The most processing intensive way of doing it is with the parity rule and check if each number is inside or out the polygon, but that is rather intensive on the processor. I've looked into flood filling methods, but they expect you to give them a point inside the polygon, something I can't really do in some polygon generations schemes. Oh and I messed up with the modulo in the first code, it's actually useless if you implement the delimited regions correctly. 

 

Anyways, I'm going to work on it.

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