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

Point To Polygon

12 posts in this topic

hey
does anyone know how to create a polygon from points? i tried googling and looking through my graphics programming books but found nothing.... I can't use any library to do this need the algorithm it self.
thanks
0

Share this post


Link to post
Share on other sites
What does "a polygon from points" mean? You have the corners of the polygon? Also in what context?
0

Share this post


Link to post
Share on other sites
Typically a polygon IS given by its vertices ("corners"). So mathematically speaking you already have a polygon. Without further context you question doesn't make much sense.
0

Share this post


Link to post
Share on other sites
A simple polygon you can make from a collection of points is a convex hull. The advantage of this is there is a unique solution for the set of input points, but it discards any points that are internal to the polygon. There are quite a few different algorithms for calculating a convex hull (of varying complexity and performance), so have a quick google and find an algorithm that is up to your level of expertise.

[attachment=11038:points1.png]

If you need to include all vertices, the polygon is going to be a concave hull, and you start to run into problems. Unless you know there are definite constraints on the way the vertices link up, like say a maximum distance or angle between vertices, you quickly discover there are many solutions for even a small number of vertices, doubly so if you allow self-intersection.

[attachment=11039:points2.png]
2

Share this post


Link to post
Share on other sites
[quote name='Postie' timestamp='1346545434' post='4975595']
If you need to include all vertices, the polygon is going to be a concave hull, and you start to run into problems. Unless you know there are definite constraints on the way the vertices link up, like say a maximum distance or angle between vertices, you quickly discover there are many solutions for even a small number of vertices, doubly so if you allow self-intersection.
[/quote]

this is what i need "concave hull". is there any algorithms..?
0

Share this post


Link to post
Share on other sites
can anyone recommend math book or game programming book that teaches these things? thanks.
or answer to this post will do as well :)
0

Share this post


Link to post
Share on other sites
[quote name='heh65532' timestamp='1346973329' post='4977411']
can anyone recommend math book or game programming book that teaches these things? thanks.
or answer to this post will do as well [img]http://public.gamedev.net//public/style_emoticons/default/smile.png[/img]
[/quote]

Well, it depends on how you want them connected. Does it matter? Edited by Doug Rogers
0

Share this post


Link to post
Share on other sites
I think that it's still unclear what you want. If you just want to render a polygon on the screen, you need to pick an API to use. Most/all have methods where you provide a list of vertices, and then a list of indices which indicate which vertices are joined to which. Or you could skip the APIs and learn how to rasterize it yourself. I imagine that rasterizing a concave polygon would be a painful experience, although there are likely papers and algorithms to handle it. Traditionally convex polygons are the easiest to deal with, particularly triangles, which is why they are so popular in computer graphics.

If you're talking about geometry problems as Postie mentioned... I've never heard of concave hull, probably because there is no unique answer, unlike convex hull, and also no specific purpose for it that I'm aware of.
0

Share this post


Link to post
Share on other sites
Ok i made this image to show what I'm trying to do.

There's a grid which represents an area. the green cells means area which borders I want to draw. First i have found the borders cells of the green area, i have them In x,y format (points). and now I want to draw the red line (border). But the problem is that the points i have collected are not in order (no indices).

I can either use some other algorithm to find the border cells and find them in correct order.
Or find a way to determine in which order the points are so the border can be drawn,




[img]http://img266.imageshack.us/img266/6487/examplese.png[/img]

hope you see now what I'm trying to accomplish :)
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