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

Point height on triangle in 3D space.

3 posts in this topic

Hello,

 

I believe there is a lot of topics about it, but I just wrote my function that returns the height. However I have strage differences in height values when moving between cells (even triangles) and I just can't realise after two days what is wrong. I am writing the code on the grounds of http://www.toymaker.info/Games/html/terrain_follow.html

 

Here is my structure which contains the terrain (the size of terrain is 256x256; the cell is a square with size of 1.0):

 

terrainstruct.png

 

here is the function:

 

 

 

float Terrain::getHeight( float x, float z ) {
    if( !m_heightMap ) return -1;


    // which cell are we in
    int _cellX = ( int )( x - m_heightMap[0].x );
    int _cellZ = ( int )( z - m_heightMap[0].z );


    // to determine which triangle we are in
    //  _____
    // |\    |
    // |  \  |
    // |____\|
    float _relativeXPos = x - _cellX;
    float _relativeZPos = z - _cellZ;


    float _height = 0.0f;
    float _vertex1[3], _vertex2[3], _vertex3[3], _vector1[3], _vector2[3];
    VectorType _normals;

    // if we are in the left triangle
    if( _relativeXPos <= _relativeZPos ) {
        // get three vertices from the triangle
        _vertex1[0] = m_heightMap[_cellX+256].x;
        _vertex1[1] = m_heightMap[_cellX+256].y;
        _vertex1[2] = m_heightMap[_cellX+256].z;


        _vertex2[0] = m_heightMap[_cellX].x;
        _vertex2[1] = m_heightMap[_cellX].y;
        _vertex2[2] = m_heightMap[_cellX].z;


        _vertex3[0] = m_heightMap[_cellX+1].x;
        _vertex3[1] = m_heightMap[_cellX+1].y;
        _vertex3[2] = m_heightMap[_cellX+1].z;


        // calculate two vectors for this triangle
        _vector1[0] = _vertex2[0] - _vertex1[0];
        _vector1[1] = _vertex2[1] - _vertex1[1];
        _vector1[2] = _vertex2[2] - _vertex1[2];
        _vector2[0] = _vertex3[0] - _vertex1[0];
        _vector2[1] = _vertex3[1] - _vertex1[1];
        _vector2[2] = _vertex3[2] - _vertex1[2];


        // calculate the normal vector of the triangle
        _normals.x = ( _vector1[1] * _vector2[2] ) - ( _vector1[2] * _vector2[1] );
        _normals.y = ( _vector1[2] * _vector2[0] ) - ( _vector1[0] * _vector2[2] );
        _normals.z = ( _vector1[0] * _vector2[1] ) - ( _vector1[1] * _vector2[0] );


        // normalize
        float _length = sqrt( ( _normals.x * _normals.x ) + ( _normals.y * _normals.y ) + ( _normals.z *  _normals.z ) );
        _normals.x /= _length;
        _normals.y /= _length;
        _normals.z /= _length;


        //P.y = V0.y+ (N.x * dx + N.z * dz ) / -N.y


        _height = _vertex1[1] + ( _normals.x * _relativeXPos + _normals.z * _relativeZPos ) / ( -_normals.y );


    } else {
        // get three vertices from the triangle
        _vertex1[0] = m_heightMap[_cellX+1].x;
        _vertex1[1] = m_heightMap[_cellX+1].y;
        _vertex1[2] = m_heightMap[_cellX+1].z;


       _vertex2[0] = m_heightMap[_cellX+257].x;
       _vertex2[1] = m_heightMap[_cellX+257].y;
       _vertex2[2] = m_heightMap[_cellX+257].z;


       _vertex3[0] = m_heightMap[_cellX+256].x;
       _vertex3[1] = m_heightMap[_cellX+256].y;
       _vertex3[2] = m_heightMap[_cellX+256].z;


       // calculate the two vectors for this triangle
       _vector1[0] = _vertex2[0] - _vertex1[0];
       _vector1[1] = _vertex2[1] - _vertex1[1];
       _vector1[2] = _vertex2[2] - _vertex1[2];
       _vector2[0] = _vertex3[0] - _vertex1[0];
       _vector2[1] = _vertex3[1] - _vertex1[1];
       _vector2[2] = _vertex3[2] - _vertex1[2];


       // calculate the normal vector of the triangle
       _normals.x = ( _vector1[1] * _vector2[2] ) - ( _vector1[2] * _vector2[1] );
       _normals.y = ( _vector1[2] * _vector2[0] ) - ( _vector1[0] * _vector2[2] );
       _normals.z = ( _vector1[0] * _vector2[1] ) - ( _vector1[1] * _vector2[0] );


      // normalize
       float _length = sqrt( ( _normals.x * _normals.x ) + ( _normals.y * _normals.y ) + ( _normals.z *     _normals.z ) );
       _normals.x /= _length;
       _normals.y /= _length;
       _normals.z /= _length;


       //P.y = V0.y+ (N.x * dx + N.z * dz ) / -N.y
       _height = _vertex1[1] + ( _normals.x * _relativeXPos + _normals.z * _relativeZPos ) / ( -_normals.y );
}

    return _height;
}

 

for example I have bigger height difference between position (2.99, 0.5) and (3.01, 0.5), but the vertices of those triangles have almost the same height and the camera jumps strangely.

 

I'd really appreciate some help, please.

 

Thank you.

0

Share this post


Link to post
Share on other sites

Did you check your normal is pointing in the right direction? The cross product may return two different normals depending on winding, if your winding isn't consistent your normals will not be either.

 

That said I'm not sure I understand what you want to do. What do you mean by height, do you mean the height of the mesh represented by your triangulated heightmap at any (x, z) position even between cells? If so, isn't it just a matter of finding the triangle you're in (which you are doing) and interpolating height from the triangle's vertices?

1

Share this post


Link to post
Share on other sites
The cells are connected, you can't be "between cells". I'd like to achieve simple effect of moving my camera on the terrain as it was moving a character.

PS How to interpolate the height in 3D triangle? Maybe it is what I am looking for.

// EDIT

okay the interpolation was what I was looking for, thank you, but still I don't understand why the code above doesn't work... Edited by jajcek
0

Share this post


Link to post
Share on other sites
The cells are connected, you can't be "between cells". I'd like to achieve simple effect of moving my camera on the terrain as it was moving a character.

PS How to interpolate the height in 3D triangle? Maybe it is what I am looking for.

// EDIT

okay the interpolation was what I was looking for, thank you, but still I don't understand why the code above doesn't work...

I meant inside a cell (not just the corners of each cell, so being able to "sample" the heightmap at any point, not just the vertices).

 

 

But what I don't understand is how your code gets the vertices from the heightmap - it can't reach all the cells with the current code. In a 2D array represented as a 1-dimensional array, the (x, z) element is:

 

m_heightMap[z * Xwidth + x]

 

In your case, Xwidth = 256. I don't see this happening anywhere in the code, in fact you're not even using _cellZ. I think this is what's wrong with the code.

 

----------

 

If this wasn't the problem, then maybe the algorithm is wrong, but it seems way too complicated for something this simple. This is what I would do:

- find the triangle in which your (x, z) coordinate is in

- you will notice the triangle surface is planar so the dh/dx and dh/dz gradient (change in height with respect to change in x and z coordinates ) is constant, calculate those quantities by taking two vertices v1 and v2 of the triangle (this can be precomputed):

 

dh/dx = (v2.y - v1.y) / (v2.x - v1.x)

dh/dz = (v2.y - v1.y) / (v2.z - v1.z)

 

- now, find the x and z distance from your point P to any vertex V (or any point on the triangle, for that matter) of the triangle, and use the gradient to find its height:

 

h = V.Y + (dh/dx) * (P.X - V.X) + (dh/dz) * (P.Z - V.Z)

 

Think of it as starting at point V, moving up or down the triangle's surface in a straight line to align yourself with point P on the x-axis by moving on the z-axis, and then going to point P again in a straight line, still remaining on the triangle's surface, travelling along the x-axis.

2

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