• 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

Find point on line closest to another point

3 posts in this topic

Say you have an arbitrary 3D line (not aligned to any axis), and a short distance away, a vertex. Is there a way to calculate what point on the line is closest to the vertex? I've seen posts that demonstrate how to find the shortest distance, but I need to come up with an actual 3D vertex that exists on the line.

For context, I'm trying to move character joints with the mouse. The line is a ray cast into the world from the mouse pointer, from the arbitrary angle of the camera, and the vertex is the character joint that I'm trying to drag around.

Share this post

Link to post
Share on other sites

if you have a normalized direction vector.


and a point, let's say:


Dir Vector = (1.0, 0.0, 0.0)

Point = (20.0, 10.0, 0.0)


the closest point on the line would be: (Dir.x*Point.x, Dir.y*Point.y, Dir.z*Point.z) (20.0, 0.0, 0.0)


let's say he have an arbitrary direction:

Dir Vector = (0.707, 0.707, 0.0)

Point = (20.0, 10.0, 0.0)


Line Point = (14.14, 7.07, 0.0)


now then, to figure out if the point is on the line, or outside the line:


let's say we have a line start point at: (5.0, 0.0, 0.0), and end point: (10.0, 0.0, 0.0)

this means we have a normalized direction of: (1.0, 0.0, 0.0).

also need to take the dot product of the direction vector and the
start/end points to check that the tested vertex is on the line(this
essentially becomes a plane equation):

(5.0*1.0 + 0.0*0.0 + 0.0*0.0) =   5

(10.0f*1.0 + 0.0*0.0 + 0.0*0.0) = 10



so, let's try 2 points: (20.0, 30.0, 0.0), and (0.0f, 30.0, 0.0).

These get plotted on the line to be: (20.0, 0.0, 0.0), and (0.0, 0.0, 0.0)

so, now we get the resulting point's dot product with the direction vector: (20*1 + 0*0 + 0*0)
= 20.  we check that this value is inside the start/end point's dot
products, if it's > or < than one or the other, it means it's past
that point.  as such the closest point to that line is at the end
point, and so, we return (10.0, 0.0, 0.0) as the closest point on the
line to the vertex.


(0.0, 0.0, 0.0) is 0 when you
take the dot product of the directional line, it is < 5, so that
means we take the start point as the closest point on a line to the vertex.


so the code would like:



struct Vector3{
 float x,y,z;
 float Dot(Vector3 &O){
  return x*O.x+y*O.y+z*O.z;
 Vector3 Normalize(void){
  float d = sqrtf(x*x+y*y+z*z);
  if(d<=0.00001f) return Vector3(x,y,z);
  d = 1.0f/d;
  return Vector3(x*d, y*d, z*d);
 //assume operator overloads for +, -, *, and constructor'sthat take's 3 floats.
Vector3 ClosestPoint(Vector3 &LineStart, Vector3 &LineEnd, Vector3 &Point){
   Vector3 Direction = (LineEnd-LineStart).Normalize();
   float LineADot = Direction.Dot(LineStart);
   float LineBDot = Direction.Dot(LineEnd);
   Vector3 LinePoint = Point*Direction;
   float LinePointDot = Direction.Dot(LinePoint);
   //check which way we need to compare LinePointDot with B and A dot products:
     if(LinePointDot>LineBDot) return LineEnd;
     elseif(LinePointDot<LineADot) return LineStart;
    if(LinePointDot<LineBDot) return LineEnd;
    elseif(LinePointDot>LineADot) return LineStart;
   return LinePoint;




that *should* work, but someone correct me if i just went on a completely lunatic babble that makes absolutely no sense.


edit: i should have checked out what JTippetts linked to first.

Edited by slicer4ever

Share this post

Link to post
Share on other sites

This can be done much simpler.  We know that we can project a vector a onto b with (dot(a, b) / dot(b, b)) * b.  We can apply this by subtracting the point by one of the points on the line, projecting onto the line vector using the above, clamping our t value if needed, and adding to that point on the line again.  Some code for you:



// p0 and p1 define the line segment, pt is an arbitrary point in space
const Vector3 ClosestPointOnSegment(const Vector3& p0, const Vector3& p1, const Vector3& pt) {
    const Vector3 lineSeg = p1 - p0; // seg vec
    // saturate clamps from 0 to 1, which will get us a point between p0 and p1
    // if we want the closest point on the infinite line defined by both points we would 
    // omit the saturate
    const float t = Saturate(Dot((pt - p0), lineSeg) / Dot(lineSeg, lineSeg));  
    return p0 + lineSeg * t;

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