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

Polygonizing a grid after subtracting an irregular portion

12 posts in this topic

I have a regular grid. I need to subtract some irregular part from it as shown in the figure. I know the coordinates of the portion to be subtracted. How can I polygonize the rest of the grid after subtracting that irregular portion?  There may be a number of ways. Could any one give me some suggestions?

0

Share this post


Link to post
Share on other sites

I have a regular grid. I need to subtract some irregular part from it as shown in the figure. I know the coordinates of the portion to be subtracted. How can I polygonize the rest of the grid after subtracting that irregular portion? There may be a number of ways. Could any one give me some suggestions?


Construct a Delaunay triangulation from the vertices?
0

Share this post


Link to post
Share on other sites

Here I only know the grid points And the boundary points to be subtracted.  Boundary points may not fall within the grid points. Then with which coordintes I need to construct the delaunay triangulation? Could you explain?

0

Share this post


Link to post
Share on other sites

With what language?  Boost::Polygon could do what you want (C++, possibly Python)

Edited by amrazek111
0

Share this post


Link to post
Share on other sites

Here I only know the grid points And the boundary points to be subtracted. Boundary points may not fall within the grid points. Then with which coordintes I need to construct the delaunay triangulation? Could you explain?

Well, you could triangulate the boundary, do an intersection test of all the grid points against the triangles, remove those which intersect then retriangulate with all remaining points?

Wouldn't be particularly efficient but should work I guess...


If using python, Shapely is a nice library for stuff like this.
0

Share this post


Link to post
Share on other sites

When you say polygonize, what do you mean?  Triangulate?  Otherwise it's just a 4 segment polygon with a hole in it, or a many-segment polygon which will have a shared edge running from the outside to the inside hole.

0

Share this post


Link to post
Share on other sites

Yes, I am looking for some triangulation method suitable for my work and which will also be efficient.

 

I have some question. When boundaries are extracted from images, I need to know how surface or 3D model are usually reconstructed from edges. As i am doing something similar, a similar kind of aproach may helpful to me.

 

Here I also need to interpolate color values. That's why I preferred about constructing  a grid so that color values can be extractd at close intervals.   Please suggest me about any better or convenient approach.

0

Share this post


Link to post
Share on other sites

Well, for triangulation [url="http://www.cs.cmu.edu/~quake/triangle.html"]Triangle (2D)[/url] or [url="http://www.qhull.org/"]QHull (2D, 3D)[/url] might work for you.  I've only worked with Triangle, but found it easy to work with and it supports holes.

 

If you're trying to create a polygon mesh out of the results, it should be pretty trivial once you have your delaunay triangulation done.  As easy as creating a triangle list out of the results.

0

Share this post


Link to post
Share on other sites

Thank you. I am looking for some code for delaunay triangulation which takes as input as a set of points and perform triangulation. The inside whole should be reflected in the output. I know MATLAB can perform this. But I am looking for C++ code.

0

Share this post


Link to post
Share on other sites

Triangle does that (assuming 2D based on OP).  Nothing forces you to use it as a command line interface.

 

http://www.cs.cmu.edu/~quake/triangle.delaunay.html

 

(edit)

It comes with the source code as a zip or shar.  If your project is for commercial purposes you may have to contact them to find out how you might get a license, though.

Edited by amrazek111
0

Share this post


Link to post
Share on other sites

Just one question, I would like to know when boundaries are extracted from images, what is the usual way to construct surface from images, is it delaunay triangulation? Or is  there any other approach? My requirement is that I need to extract 3D geometry from the images and at the same time, it is supposed to preserve color.

0

Share this post


Link to post
Share on other sites

If you triangulate your polygons, you'll have a set of vertices and triangles you can use for a triangle mesh.

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