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

Height on triangles using 4 points

6 posts in this topic

Hi guys,

I'm trying to implement smooth following on my terrain and i'm running into a few problems. I am able to get the height of the nearest vertex to my position and set my players position to that, but that is a bit 'jumpy' and i'd like to smoothly follow the terrain.

What i'm currently doing is getting a vertex that corresponds to a 2d array. From this i can get the 3 other surrounding points of the players position like this:

Point3 p1 = height [ i + 1] [ j ]
Point3 p2 = height [ i ] [ j + 1]
Point3 p3 = height [ i + 1 ] [ j + 1 ]

p2 ------------- p3
|--------------/----|
|----------/--------|
|-------/-----------| <--- Players position is somewhere in there
|---/---------------|
p0---------------p1

So I currently have 4 points and i'd like to know how i can get the height at my characters position using these height values. Also, i'd like to add that the terrain is drawn with triangles, so i've been trying to determine which triangle (p0, p1, p3) or (p0, p2, p3) that the point is on before hand.

I am terribly average at mathematics and i've been trying hopelessly and my height always ends up way off.

Thanks for any help!

ps: sorry for the awful triangle drawings [img]http://public.gamedev.net//public/style_emoticons/default/tongue.png[/img]

- rocklobster
0

Share this post


Link to post
Share on other sites
What you need, is:[list=1]
[*]Test, whether point is inside triangle
[*]Construct plane from three points
[*]Find line-plane intersection point
[/list]

1. As you already know in which grid square your point lies, you can test whether it is closer to p1 or p2. Just use squared distance of 2D vectors (ignore Z)

2. Construct plane from three points (plane is given as normal vector Pn and scalar value Pd). I use P0, P1 and P3 as example triangle.

n = (P1 - P0) cross (P3 - P0)
Pn = normalize (n)
Pd = -Pn dot P0

3. Find line-plane intersection point (line is given as point Lp and direction Ld, intersection point is P)

den = Pn dot Ld
If den is 0 then line is parallel to plane
t = -(Pn dot Lp + Pd) / den
P = Lp + t * Ld

In your case you can use line, that starts from same realistic place - say 10m above the head of character and goes directly downwards - i.e. Lp = (playerX, playerY, playerLastZ + 10), Ld = (0,0,-1).
1

Share this post


Link to post
Share on other sites
Thanks for the reply, i'm understanding most of it. Just what do u mean by
[quote name='Lauris Kaplinski' timestamp='1333746824' post='4928902']
Just use squared distance of 2D vectors (ignore Z)
[/quote]
0

Share this post


Link to post
Share on other sites
[quote name='rocklobster' timestamp='1333789810' post='4928992']
Thanks for the reply, i'm understanding most of it. Just what do u mean by
[quote name='Lauris Kaplinski' timestamp='1333746824' post='4928902']
Just use squared distance of 2D vectors (ignore Z)
[/quote]
[/quote]
I should have said "squared distance between two 2D points :-)

To determine where your point lies, you have to project it to XY plane. I.e. if you have player position P=(Px,Py,Pz), make it 2D vector P'=(Pz,Py) and test, int which triangle it lies by finding the its distance from 2D vectors P1'=(P1x,P1y) and P2'=(P2x,P2y)

And instead of calculating and comparing actual distances between P and P1 or P2, you can compare squared distances. I.e. instead of

L = sqrt ((Px - P1x)*(Px - P1x) + (Py-P1y)*(Py-P1y))

You can leave out square root and use

Lsquared = (Px - P1x)*(Px - P1x) + (Py-P1y)*(Py-P1y)

Now this is pointless optmization - but it does not hurt.
1

Share this post


Link to post
Share on other sites
[quote name='rocklobster' timestamp='1333795489' post='4929015']
If Y is my up vector, shouldn't i be using x and z to find the distance between the points?
[/quote]
Oh, yes of course ;-)
1

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