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

Edge selection on a 2D grid

6 posts in this topic

I am working on a HTML5/javascript application which allows users to create 2d shapes on a canvas(rectangles, squares, etc).

I want to allow users to be able to select any edge of these objects using mouse clicks and modify the shapes. 

 

I am very new to HTML5/javascript or game programming. I am unable to implement the edge selection using mouse clicks. Any pointers on how to implement this?

0

Share this post


Link to post
Share on other sites

You need to get the closest point on the line (segment) to the point clicked, then you can compare the distance between your click point and this point to see if it is within a certain threshold.

 

A 3D version in C++ for closest point on segment to point:

Vec3 closestPointOnSegmentToPoint(const Vec3 &segment1, const Vec3 &segment2, const Vec3 &point)
{
    Vec3 ab = segment2 - segment1;

    if(dotVectors(ab, ab) < 0.01f) return ab;

    float t = dotVectors(point - segment1, ab) / dotVectors(ab, ab);

    if(t < 0.0f) t = 0.0f;
    if(t > 1.0f) t = 1.0f;

    return segment1 + (t * ab);
}

That will return the point on the segment that is closest to the point input. You can then just form a vector from this point to the click point and check its length to see if it is close enough to be considered clicked on the line.

 

Appreciate a lot of that is over your head if you are new to this. Suggest reading up on 2D vector stuff, looking at what support Java has for vector math and so on.

1

Share this post


Link to post
Share on other sites

Thanks for the quick reply.

 

I do understand the logic here, however, wont it be too slow once I have many segments on the canvas? I will need to loop over all the line segments and find out which one is the closed to point?

0

Share this post


Link to post
Share on other sites

Thanks for the quick reply.
 
I do understand the logic here, however, wont it be too slow once I have many segments on the canvas? I will need to loop over all the line segments and find out which one is the closed to point?


Well, that depends on what you mean by "many". If you really have a lot of segments, there are fancier techniques that can be used. But you can always start with the simple code and think about it harder only if it proves to be too slow.
0

Share this post


Link to post
Share on other sites

I will definitely start with the simpler technique like the one mentioned by Aardvajk, but it would be great if you can share some pointers on some advanced techniques. I came across R-trees while researching, is there any detail explanation on how to implement it? I am planning to create a 3D application at some point in future, and any reference material on this topic would help.

0

Share this post


Link to post
Share on other sites
Yes, space-partitioning techniques like R-trees can be used.

You could also use something like OpenGL to render thickened segments, using a unique id for the segment as the color and a depth value that corresponds to the distance to the segment (you could use a texture for this, or perhaps a fragment shader). You would render this to a texture and then you just need to look up where the user clicked.

I am not sure the latter suggestion is particularly good in this situation, but it illustrates a general technique to be aware of.
0

Share this post


Link to post
Share on other sites

Also note. You'll be amazed how many times you can run a closest point to line test without it taking any significant time. And any spatial partitioning system has its own overhead in time and complexity.

 

I've dumped entire spatial partitioning systems over a broadphase AABB check because the former has been faster and far less complex.

 

What you can do here is form an AABB from the end points of the line and check the point is inside the AABB first, but I'm not even sure that will be significantly quicker in this particular case.

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