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

Given a set of Vertices: Determine Boundary Vertices and Connection Order

6 posts in this topic

Hello

I am looking for suggestions on algorithms I can use to determine the boundary points/vertices of a list of vertices. I also need to determine which boundary point connects to which other boundary point.

 

2wqzif8.jpg

I have my own solution but it involves alot of steps and is more procedurally based rather than mathematically based. Can you suggest any algorithms (both procedural and mathematic)?

My approach:

  •    - Organise the vertices into a Dictionary <int, List<Triangle>> vertexTriangleMap. Where the keys are the indexes of the vertices and the values are lists of the triangles that involve that vertex
  •    - Pick a random vertex(RV) then pick a random triangle involving that vertex. For eg; vertexTriangleMap[9][0]
  •    - Of the 2 other vertices in this triangle: Determine which involves the least triangles (the point w the least triangles = OV)
  •        - Search through OV's triangles looking for another triangle that involves the vertices OV AND RV:
  •            - if there is more than 1 triangle that involves these 2 points then that means that OV is NOT a boundary point else OV is a boundary point AND I know it connects to RV. OV now becomes RV and I can now repeat the process and I will determine which boundary points connect to which. I'll know when to stop when I reach the beginning again (the first RV).

       

 

Edited by gretty
0

Share this post


Link to post
Share on other sites

That will help me ensure that the first random point is infact a boundary point but not all boundary vertices involve 1 triangle. Look at the example picture on my OP. The top left corner involves 2 and the next 2 boundary points below involve even more triangles.

 

Determining the number of triangles each vertex is involved in and using the least as the boundary points was my original approach but it doesn't work. For irregular TINs (Triangular Irregular Networks), like ones that aren't rectangular, a boundary point can have as much as 5 triangles or more.

Edited by gretty
0

Share this post


Link to post
Share on other sites

A boundary edge does involve just 1 triangle though. Do you not know edge information for your vertices? Find the edges then classify the vertices.

0

Share this post


Link to post
Share on other sites

Not clear if you already have a triangulation. If not, there are an infinite number of ways to triangulate a vertex cloud; to define connectivity between vertices. If you only need to connect vertices on the boundary, computing the convex hull (QuickHull algorithm) probably makes most sense. If you want to allow concavities in the hull, you could insert vertices into a Delaunay triangulation.

Edited by eppo
0

Share this post


Link to post
Share on other sites

Not clear if you already have a triangulation. If not, there are an infinite number of ways to triangulate a vertex cloud; to define connectivity between vertices. If you only need to connect vertices on the boundary, computing the convex hull (QuickHull algorithm) probably makes most sense. If you want to allow concavities in the hull, you could insert vertices into a Delaunay triangulation.

 

Thanks QuickHull looks like a nice elegant solution but unfortunately wont work for the tins I am working with - they are tins of roads so imagine a loose 'J' shape. With QuickHull I'll end up having the end of the J joined to the start of the J I believe.

 

I'll look into Delaunay, at first glance it looks like this algorithm calculates all vertex connections/triangles and not just the boundary points? Is that correct?

 

Yes, the information I have is the triangulation and the vertices, thats the only information I have but not the boundary vertices or their connection order.

Edited by gretty
0

Share this post


Link to post
Share on other sites

Well it's not hard to build a list of edges from triangulation data if neighbouring triangles share vertices. Once you have edge information it is easy to find boundary edges and vertices.

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