Followers 0

# OpenGL Triangulation OpenGl C++

## 1 post in this topic

Hi everyone,

I have data corresponding to points of a surface of water and I trying to triangulate them. I thus obtained these functions from my teacher :


typedef struct
{
float x, y;
} Point2D;

typedef struct
{
Point2D p1, p2, p3;
} Triangle2D;

Triangle2D* Terrain::Process( int nb_points, Point2D *points, int& nb_triangles )
{
/* allocate and initialize list of Vertices in polygon */
Triangle2D *triangles = new Triangle2D[nb_points-2];
nb_triangles = 0;

int n = nb_points;
if ( n < 3 ) return false;

int *V = new int[n];

/* we want a counter-clockwise polygon in V */

if ( 0.0f < Area(nb_points, points) )
for (int v=0; v<n; v++) V[v] = v;
else
for(int v=0; v<n; v++) V[v] = (n-1)-v;

int nv = n;

/*  remove nv-2 Vertices, creating 1 triangle every time */
int count = 2*nv;   /* error detection */

for(int m=0, v=nv-1; nv>2; )
{

/* if we loop, it is probably a non-simple polygon */
if (0 >= (count--))
{
//** Triangulate: ERROR - probable bad polygon!
// delete[] triangles;
printf( "Degenerate polygon\n" );
return triangles;
}

/* three consecutive vertices in current polygon, <u,v,w> */
int u = v  ; if (nv <= u) u = 0;     /* previous */
v = u+1; if (nv <= v) v = 0;     /* new v    */
int w = v+1; if (nv <= w) w = 0;     /* next     */

if ( Snip(nb_points, points,u,v,w,nv,V) )
{
int a,b,c,s,t;

/* true names of the vertices */
a = V[u]; b = V[v]; c = V[w];

/* output Triangle */
/*   result.push_back( points[a] );
result.push_back( points[b] );
result.push_back( points[c] );*/

triangles[nb_triangles].p1 = points[a];
triangles[nb_triangles].p2 = points[b];
triangles[nb_triangles].p3 = points[c];
nb_triangles++;

m++;

/* remove v from remaining polygon */
for(s=v,t=v+1;t<nv;s++,t++) V[s] = V[t]; nv--;

/* resest error detection counter */
count = 2*nv;
}
}

delete V;

return triangles;
}

float Terrain::Area( int nb_points, Point2D *points )
{

int n = nb_points;

float A=0.0f;

for(int p=n-1,q=0; q<n; p=q++)
{
A+= points[p].x*points[q].y - points[q].x*points[p].y;
}
return A*0.5f;
}

bool Terrain::Snip( int nb_points, Point2D *points,int u,int v,int w,int n,int *V )
{
int p;
float Ax, Ay, Bx, By, Cx, Cy, Px, Py;

Ax = points[V[u]].x;
Ay = points[V[u]].y;

Bx = points[V[v]].x;
By = points[V[v]].y;

Cx = points[V[w]].x;
Cy = points[V[w]].y;

if ( EPSILON > (((Bx-Ax)*(Cy-Ay)) - ((By-Ay)*(Cx-Ax))) ) return false;

for (p=0;p<n;p++)
{
if( (p == u) || (p == v) || (p == w) ) continue;
Px = points[V[p]].x;
Py = points[V[p]].y;
if (InsideTriangle(Ax,Ay,Bx,By,Cx,Cy,Px,Py)) return false;
}

return true;
}

bool Terrain::InsideTriangle(float Ax, float Ay,
float Bx, float By,
float Cx, float Cy,
float Px, float Py)

{
float ax, ay, bx, by, cx, cy, apx, apy, bpx, bpy, cpx, cpy;
float cCROSSap, bCROSScp, aCROSSbp;

ax = Cx - Bx;  ay = Cy - By;
bx = Ax - Cx;  by = Ay - Cy;
cx = Bx - Ax;  cy = By - Ay;
apx= Px - Ax;  apy= Py - Ay;
bpx= Px - Bx;  bpy= Py - By;
cpx= Px - Cx;  cpy= Py - Cy;

aCROSSbp = ax*bpy - ay*bpx;
cCROSSap = cx*apy - cy*apx;
bCROSScp = bx*cpy - by*cpx;

return ((aCROSSbp >= 0.0f) && (bCROSScp >= 0.0f) && (cCROSSap >= 0.0f));
}


It works except that it takes place in this way: the file containing points has more than a million points, and I try to draw only certain triangles being situated in a specific zone.
OK, except that it is possible that there are degenerated triangles, that is we do not have every everything points of a triangle.

As a result, what it takes place, it is that after the triangulation of the specific triangles, I notice that it draws not the zone desired but what there is all around.

So I want to change the algorithm of triangulation but I do not find (either I did not enough search) of algo easily implémentables (which are not very different of my structures)

Would you have any suggestions to be proposed to me?

PS : The points of the mif file look like :

976130.4 6449595.49999999
976127.2 6449598.09999999
976124.7 6449601.79999999
976122.4 6449605.79999999
976120.3 6449610.09999999
976117.2 6449615.39999999
976115.7 6449619.29999999
976114.9 6449623.59999999
976115.7 6449627.49999999
976119.4 6449630.69999999
976121.7 6449634.89999999
976120.6 6449639.49999999

This is a pics to expose my problem : The real surface is in the middle http://img11.hostingpics.net/pics/469919Capturedcran20140318161524.png
Edited by bloupies
0

##### Share on other sites

I'll preface this by saying that robust triangulation is very difficult. Whatever you implement will almost certainly fail for some inputs.

FIST (http://www.cosy.sbg.ac.at/~held/projects/triang/triang.html) is an algorithm that is comparatively easy to implement. It relies on ear clipping, as does yours. The paper is good, and pretty easy to read.

1) Performance:

Given you're dealing with 1e6 points, you really should use some kind of spatial subdivision structure to accelerate your search for points inside the ear you intend to clip.

When you clip an ear of your polygon, having to move ~1e6 indices in V seems wasteful. A linked list might actually be an appropriate structure here (especially if you don't allocate nodes individually, but as a block). At the very least, start working backwards from the back of the array, rather than the front, so that you have less data to shift around.

Exploit locality of reference by not moving v when you successfully clip an ear.

2) Triangulation quality:

It seems like you're worried about producing large triangles that make it hard to render small regions of the total triangulation efficiently. If you think about a circle, there are basically two approaches to producing a triangulation. One will produce a fan, with long thin triangles. The other will produce lots of small triangles at the edge, and some large triangles at the centre. Any way you triangulate a circle will produce a result that is hard to render locally. In general I believe you won't be able to avoid this.

You could attempt to improve the quality of your triangulation by looking at adjacent triangles (that form a quad) and flipping the internal edge. You can treat this as an optimization problem - define a flip cost as being the differences in summed areas of the bounding boxes of the two triangles before and after flipping, and then greedily flip triangle pairs while you can decrease the cost. Other cost functions (such as considering how far the triangles deviate from equilateral) will also work.

I suspect that what you want to do is to add points to smooth out the triangulation. This is not easy to implement, but you can take a look at the Triangle library, by Jonathan Shewchuk (http://www.cs.cmu.edu/~quake/triangle.html) for an implementation of conforming delaunay triangulation (which is what you want). The Triangle code is free for non-commercial use, so this might be an option for you.

Toby.

0

## Create an account

Register a new account

Followers 0

• ### Similar Content

• By DaniDesu
#include "MyEngine.h" int main() { MyEngine myEngine; myEngine.run(); return 0; } MyEngine.h
#pragma once #include "MyWindow.h" #include "MyShaders.h" #include "MyShapes.h" class MyEngine { private: GLFWwindow * myWindowHandle; MyWindow * myWindow; public: MyEngine(); ~MyEngine(); void run(); }; MyEngine.cpp
#pragma once #include <glad\glad.h> #include <GLFW\glfw3.h> class MyWindow { private: GLFWwindow * windowHandle; int windowWidth; int windowHeight; const char * windowTitle; public: MyWindow(int windowWidth, int windowHeight, const char * windowTitle); ~MyWindow(); GLFWwindow * getWindowHandle(); void createWindow(); void MyWindow::destroyWindow(); }; MyWindow.cpp
#include "MyWindow.h" MyWindow::MyWindow(int windowWidth, int windowHeight, const char * windowTitle) { this->windowHandle = NULL; this->windowWidth = windowWidth; this->windowWidth = windowWidth; this->windowHeight = windowHeight; this->windowTitle = windowTitle; glfwInit(); } MyWindow::~MyWindow() { } GLFWwindow * MyWindow::getWindowHandle() { return this->windowHandle; } void MyWindow::createWindow() { // Use OpenGL 3.3 and GLSL 3.3 glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3); glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3); // Limit backwards compatibility glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE); glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE); // Prevent resizing window glfwWindowHint(GLFW_RESIZABLE, GL_FALSE); // Create window this->windowHandle = glfwCreateWindow(this->windowWidth, this->windowHeight, this->windowTitle, NULL, NULL); glfwMakeContextCurrent(this->windowHandle); } void MyWindow::destroyWindow() { glfwTerminate(); } MyShapes.h
#pragma once #include <glad\glad.h> #include <GLFW\glfw3.h> class MyShapes { public: MyShapes(); ~MyShapes(); GLuint & drawTriangle(float coordinates[]); }; MyShapes.cpp
#include "MyShapes.h" MyShapes::MyShapes() { } MyShapes::~MyShapes() { } GLuint & MyShapes::drawTriangle(float coordinates[]) { GLuint vertexBufferObject{}; GLuint vertexArrayObject{}; // Create a VAO glGenVertexArrays(1, &vertexArrayObject); glBindVertexArray(vertexArrayObject); // Send vertices to the GPU glGenBuffers(1, &vertexBufferObject); glBindBuffer(GL_ARRAY_BUFFER, vertexBufferObject); glBufferData(GL_ARRAY_BUFFER, sizeof(coordinates), coordinates, GL_STATIC_DRAW); // Dertermine the interpretation of the array buffer glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 3*sizeof(float), (void *)0); glEnableVertexAttribArray(0); // Unbind the buffers glBindBuffer(GL_ARRAY_BUFFER, 0); glBindVertexArray(0); return vertexArrayObject; } MyFileHandler.h
#pragma once #include <cstdio> #include <cstdlib> class MyFileHandler { private: const char * fileName; unsigned long fileSize; void setFileSize(); public: MyFileHandler(const char * fileName); ~MyFileHandler(); unsigned long getFileSize(); const char * readFile(); }; MyFileHandler.cpp
#include "MyFileHandler.h" MyFileHandler::MyFileHandler(const char * fileName) { this->fileName = fileName; this->setFileSize(); } MyFileHandler::~MyFileHandler() { } void MyFileHandler::setFileSize() { FILE * fileHandle = NULL; fopen_s(&fileHandle, this->fileName, "rb"); fseek(fileHandle, 0L, SEEK_END); this->fileSize = ftell(fileHandle); rewind(fileHandle); fclose(fileHandle); return; } unsigned long MyFileHandler::getFileSize() { return (this->fileSize); } const char * MyFileHandler::readFile() { char * buffer = (char *)malloc((this->fileSize)+1); FILE * fileHandle = NULL; fopen_s(&fileHandle, this->fileName, "rb"); fread(buffer, this->fileSize, sizeof(char), fileHandle); fclose(fileHandle); buffer[this->fileSize] = '\0'; return buffer; } VertexShader.glsl
#version 330 core layout (location = 0) vec3 VertexPositions; void main() { gl_Position = vec4(VertexPositions, 1.0f); } FragmentShader.glsl
#version 330 core out vec4 FragmentColor; void main() { FragmentColor = vec4(1.0f, 0.0f, 0.0f, 1.0f); } I am attempting to create a simple engine/graphics utility using some object-oriented paradigms. My first goal is to get some output from my engine, namely, a simple red triangle.
For this goal, the MyShapes class will be responsible for defining shapes such as triangles, polygons etc. Currently, there is only a drawTriangle() method implemented, because I first wanted to see whether it works or not before attempting to code other shape drawing methods.
The constructor of the MyEngine class creates a GLFW window (GLAD is also initialized here to load all OpenGL functionality), and the myEngine.run() method in Main.cpp is responsible for firing up the engine. In this run() method, the shaders get loaded from files via the help of my FileHandler class. The vertices for the triangle are processed by the myShapes.drawTriangle() method where a vertex array object, a vertex buffer object and vertrex attributes are set for this purpose.
The while loop in the run() method should be outputting me the desired red triangle, but all I get is a grey window area. Why?
(Note: I am aware that this code is not using any good software engineering practices (e.g. exceptions, error handling). I am planning to implement them later, once I get the hang of OpenGL.)

• By KarimIO
EDIT: I thought this was restricted to Attribute-Created GL contexts, but it isn't, so I rewrote the post.
Hey guys, whenever I call SwapBuffers(hDC), I get a crash, and I get a "Too many posts were made to a semaphore." from Windows as I call SwapBuffers. What could be the cause of this?
Update: No crash occurs if I don't draw, just clear and swap.
static PIXELFORMATDESCRIPTOR pfd = // pfd Tells Windows How We Want Things To Be { sizeof(PIXELFORMATDESCRIPTOR), // Size Of This Pixel Format Descriptor 1, // Version Number PFD_DRAW_TO_WINDOW | // Format Must Support Window PFD_SUPPORT_OPENGL | // Format Must Support OpenGL PFD_DOUBLEBUFFER, // Must Support Double Buffering PFD_TYPE_RGBA, // Request An RGBA Format 32, // Select Our Color Depth 0, 0, 0, 0, 0, 0, // Color Bits Ignored 0, // No Alpha Buffer 0, // Shift Bit Ignored 0, // No Accumulation Buffer 0, 0, 0, 0, // Accumulation Bits Ignored 24, // 24Bit Z-Buffer (Depth Buffer) 0, // No Stencil Buffer 0, // No Auxiliary Buffer PFD_MAIN_PLANE, // Main Drawing Layer 0, // Reserved 0, 0, 0 // Layer Masks Ignored }; if (!(hDC = GetDC(windowHandle))) return false; unsigned int PixelFormat; if (!(PixelFormat = ChoosePixelFormat(hDC, &pfd))) return false; if (!SetPixelFormat(hDC, PixelFormat, &pfd)) return false; hRC = wglCreateContext(hDC); if (!hRC) { std::cout << "wglCreateContext Failed!\n"; return false; } if (wglMakeCurrent(hDC, hRC) == NULL) { std::cout << "Make Context Current Second Failed!\n"; return false; } ... // OGL Buffer Initialization glClear(GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT); glBindVertexArray(vao); glUseProgram(myprogram); glDrawElements(GL_TRIANGLES, indexCount, GL_UNSIGNED_SHORT, (void *)indexStart); SwapBuffers(GetDC(window_handle));
• By Tchom
Hey devs!

I've been working on a OpenGL ES 2.0 android engine and I have begun implementing some simple (point) lighting. I had something fairly simple working, so I tried to get fancy and added color-tinting light. And it works great... with only one or two lights. Any more than that, the application drops about 15 frames per light added (my ideal is at least 4 or 5). I know implementing lighting is expensive, I just didn't think it was that expensive. I'm fairly new to the world of OpenGL and GLSL, so there is a good chance I've written some crappy shader code. If anyone had any feedback or tips on how I can optimize this code, please let me know.

uniform mat4 u_MVPMatrix; uniform mat4 u_MVMatrix; attribute vec4 a_Position; attribute vec3 a_Normal; attribute vec2 a_TexCoordinate; varying vec3 v_Position; varying vec3 v_Normal; varying vec2 v_TexCoordinate; void main() { v_Position = vec3(u_MVMatrix * a_Position); v_TexCoordinate = a_TexCoordinate; v_Normal = vec3(u_MVMatrix * vec4(a_Normal, 0.0)); gl_Position = u_MVPMatrix * a_Position; } Fragment Shader
precision mediump float; uniform vec4 u_LightPos["+numLights+"]; uniform vec4 u_LightColours["+numLights+"]; uniform float u_LightPower["+numLights+"]; uniform sampler2D u_Texture; varying vec3 v_Position; varying vec3 v_Normal; varying vec2 v_TexCoordinate; void main() { gl_FragColor = (texture2D(u_Texture, v_TexCoordinate)); float diffuse = 0.0; vec4 colourSum = vec4(1.0); for (int i = 0; i < "+numLights+"; i++) { vec3 toPointLight = vec3(u_LightPos[i]); float distance = length(toPointLight - v_Position); vec3 lightVector = normalize(toPointLight - v_Position); float diffuseDiff = 0.0; // The diffuse difference contributed from current light diffuseDiff = max(dot(v_Normal, lightVector), 0.0); diffuseDiff = diffuseDiff * (1.0 / (1.0 + ((1.0-u_LightPower[i])* distance * distance))); //Determine attenuatio diffuse += diffuseDiff; gl_FragColor.rgb *= vec3(1.0) / ((vec3(1.0) + ((vec3(1.0) - vec3(u_LightColours[i]))*diffuseDiff))); //The expensive part } diffuse += 0.1; //Add ambient light gl_FragColor.rgb *= diffuse; } Am I making any rookie mistakes? Or am I just being unrealistic about what I can do? Thanks in advance
• By yahiko00
Hi,
Not sure to post at the right place, if not, please forgive me...
For a game project I am working on, I would like to implement a 2D starfield as a background.
I do not want to deal with static tiles, since I plan to slowly animate the starfield. So, I am trying to figure out how to generate a random starfield for the entire map.
I feel that using a uniform distribution for the stars will not do the trick. Instead I would like something similar to the screenshot below, taken from the game Star Wars: Empire At War (all credits to Lucasfilm, Disney, and so on...).

Is there someone who could have an idea of a distribution which could result in such a starfield?
Any insight would be appreciated

• I have just noticed that, in quake 3 and half - life, dynamic models are effected from light map. For example in dark areas, gun that player holds seems darker. How did they achieve this effect ? I can use image based lighting techniques however (Like placing an environment probe and using it for reflections and ambient lighting), this tech wasn't used in games back then, so there must be a simpler method to do this.
Here is a link that shows how modern engines does it. Indirect Lighting Cache It would be nice if you know a paper that explains this technique. Can I apply this to quake 3' s light map generator and bsp format ?

• 27
• 12
• 11
• 31
• 20