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

DX11
Getting around non-connected vertex gaps in hardware tessellation displacement mapping

21 posts in this topic

Thanks MJP.

I don't suppose there's any video / audio recording of the presentation using those slides available somewhere, possibly for a nominal fee?

 

On a more off-topic note, I recognize that avatar of yours but have been unable to remember the name of the show (or was it possibly a book?) it featured in, care to enlighten me? 

0

Share this post


Link to post
Share on other sites


I don't suppose there's any video / audio recording of the presentation using those slides available somewhere, possibly for a nominal fee?

 

Not that I know of, sorry.

 


On a more off-topic note, I recognize that avatar of yours but have been unable to remember the name of the show (or was it possibly a book?) it featured in, care to enlighten me?

 

It's Rocko!

0

Share this post


Link to post
Share on other sites

That is that. Thank you very much. smile.png

 

With "initial" IB (notice cracks):

crack.jpg

 

PNAEN

good.jpg

 

Now i would like to displace position along normal using heightmap but i dont know how to get average normal so i can pass it to domain shader. Any pointers?

0

Share this post


Link to post
Share on other sites


It's Rocko!

Ah yes, haha, remember watching that in the mid-late 90's. Maybe worth a rewatch now that I'm old enough to actually understand it better than back then...

 

As for the displacement mapping I eventually settled on a rather simple approach for use with pre-existing triangle list meshes (it is by no means perfect but it seems that the "real" solution is really just having the 3D / texturing artist(s) being aware of your intents and have them author appropriately mapped bump maps and ensure corners actually are rounded, albeit with extremely short edges between corner vertices, as seemed to be the main point that the chapter in Zink, Pettineo & Hoxley (2011) as referred by unbird in the last post). Basically I average all disjoint vertex normals and create a 6-control patch index buffer that holds the initial triangle in the first 3 indices and then any "dominant" vertices sharing the position of these original vertices in the last 3 indices. The dominant vertices are arbitrarily chosen as the first found in the vertex data for a given position and are set to the same vertex as in the first three indices if there are no shared vertices at a given position. The dominant vertex is used to ensure that all overlapping vertices will sample the same value from the displacement map, while still allowing them to sample other textures by their UV coords.

Not perfect but good enough for some general-purpose examples.

As for actually employing this kind of displacement mapping in a more professional game / visual demo / what-have-you, the artist should ensure that there are *no* disjoint vertices (as said, such vertices can be moved slightly apart and be connected by a short edge, allowing the corners to appear mostly sharp) and a secondary set of texture coordinates should be provided for the displacement map / alternatively the displacement map should be handcrafted such that when displaced (with a reasonable strength / height factor), faces won't extrude through each others.

Of course there exists more elaborate ways as described in the previous posts, I just thought I would share this if anyone found it interesting, After tracking down a copy of that practical rendering book just for that tessellation chapter, it didn't say that much more about this particular problem, so might as well save others the trouble.

0

Share this post


Link to post
Share on other sites

Hi,

i'm struggling with PN AEN now for two weeks and I'm not sure where my mistake could be... I'm pretty sure, the indices are correct, since I tried out unbirds exmaple and get the same indices. However my result looks like this:screenshot.png

 

I get the same result as with PN Triangles, no difference.

 

My TCS is:

#version 420
layout (vertices = 9) out;
in vec3 vp[];
in vec2 UV[];
in vec3 vn[];
out vec3 vpos[];
out vec2 outuv[];
out vec3 vnor[];
uniform vec3  tessLevelOuter;
uniform float tessLevelInner;

patch out Patch
{
    vec3 b210;
    vec3 b120;
    vec3 b021;
    vec3 b012;
    vec3 b102;
    vec3 b201;
    vec3 b111;
    vec3 n110;
    vec3 n011;
    vec3 n101;
	vec2 t110;
    vec2 t011;
    vec2 t101;
} OutPatch;

#define b300 vp[0]
#define b030 vp[1]
#define b003 vp[2]

#define n200 vn[0]
#define n020 vn[1]
#define n002 vn[2]

#define t200 UV[0]
#define t020 UV[1]
#define t002 UV[2]

void main()
{

	if( gl_InvocationID == 0 )
		{
			gl_TessLevelOuter[0] = tessLevelOuter[0];
			gl_TessLevelOuter[1] = tessLevelOuter[1];
			gl_TessLevelOuter[2] = tessLevelOuter[2];
			gl_TessLevelInner[0] = tessLevelInner;
		}
		vpos[gl_InvocationID]=vp[gl_InvocationID];
		vnor[gl_InvocationID]=vn[gl_InvocationID];
		outuv[gl_InvocationID]=UV[gl_InvocationID];
		
		if( gl_InvocationID == 0 )
    {

						 
						 
		OutPatch.b210 = (2.0 * b300 + b030 - dot( b030 - b300, n200 ) * n200 + 2.0 * vp[3] + vp[4] - dot( vp[4] - vp[3], vn[3] ) * vn[3] ) / 6.0;
        OutPatch.b120 = (2.0 * b030 + b300 - dot( b300 - b030, n020 ) * n020 +2.0 * vp[4] + vp[3] -dot( vp[3] - vp[4], vn[4] ) * vn[4] ) / 6.0;
        OutPatch.b021 = (2.0 * b030 + b003 - dot( b003 - b030, n020 ) * n020 +2.0 * vp[5] + vp[6] - dot( vp[6] - vp[5], vn[5] ) * vn[5] ) / 6.0;
        OutPatch.b012 = (2.0 * b003 + b030 - dot( b030 - b003, n002 ) * n002 +2.0 * vp[6] + vp[5] - dot( vp[5] - vp[6], vn[6] ) * vn[6] ) / 6.0;
        OutPatch.b102 = (2.0 * b003 + b300 - dot( b300 - b003, n002 ) * n002 +2.0 * vp[7] + vp[8] -dot( vp[8] - vp[7], vn[7] ) * vn[7] ) / 6.0;
        OutPatch.b201 = (2.0 * b300 + b003 - dot( b003 - b300, n200 ) * n200 + 2.0 * vp[8] + vp[7] -dot( vp[7] - vp[8], vn[8] ) * vn[8] ) / 6.0;
				 
		OutPatch.b111 = (OutPatch.b210 + OutPatch.b120 + OutPatch.b021 +
                         OutPatch.b012 + OutPatch.b102 + OutPatch.b201) / 4.0 - (b300 + b030 + b003) / 6.0;				 
						 
						 
						 

        const vec3 d0 = b030 - b300;
        const vec3 d1 = b003 - b030;
        const vec3 d2 = b300 - b003;
        const vec3 n0 = n020 + n200;
        const vec3 n1 = n002 + n020;
        const vec3 n2 = n200 + n002;
        const vec3 v0 = (2.0 * dot( d0, n0 ) / dot( d0, d0 )) * d0;
        const vec3 v1 = (2.0 * dot( d1, n1 ) / dot( d1, d1 )) * d1;
        const vec3 v2 = (2.0 * dot( d2, n2 ) / dot( d2, d2 )) * d2;
        OutPatch.n110 = normalize( n0 - v0 );
        OutPatch.n011 = normalize( n1 - v1 );
        OutPatch.n101 = normalize( n2 - v2 );
     }
}

Any ideas what I'm doing wrong?

0

Share this post


Link to post
Share on other sites

Off the top of my head each individual face of your cube is tessellated and then displaced.

You need to ensure that the edge vertices are shared in each (subdivided) side-face or else these seams will occur since all vertices on the top face are displaced only along the up axis and all vertices of the front face are displaced only along the depth axis.

A simple solution is to displace along the vertex normals and ensure that whereever you have overlapping vertices (such as at the corners of a cube) you set the normal of all such vertices to the average of all "actual" vertex normals at that position. This will make the edges a bit more bulky but keep the faces connected.

 

My previous post in this thread (just above yours) describes how I solved this in a relatively simple way in more detail.

1

Share this post


Link to post
Share on other sites

I'm not doing any Displayment mapping so far.

My TES looks like this:

	vec3 vp=vpos[0] * w * w * w +
                          b030 * u * u * u +
                          b003 * v * v * v + 
						  InPatch.b210 * 3.0 * w * w * u + 
                          InPatch.b120 * 3.0 * w * u * u +
                          InPatch.b201 * 3.0 * w * w * v +
                          InPatch.b021 * 3.0 * u * u * v +
                          InPatch.b102 * 3.0 * w * v * v +
                          InPatch.b012 * 3.0 * u * v * v +
                          InPatch.b111 * 6.0 * w * u * v; 

	vec3 vn= normalize( n200 * w * w + n020 * u * u + n002 * v * v +
                             InPatch.n110 * w * u + InPatch.n011 * u * v + InPatch.n101 * w * v );

About the screenshot above: I'm not applying any displacement yet. The cube simply cracks by smoothing the surface. As far as I understood this is a known issue with PN, but PNAEN shouldn't have this problem.

I know that you meant dominant UV to solve displacement map cracking, but I still have PN cracking with PNAEN.

0

Share this post


Link to post
Share on other sites

I just fed a standard cube to my shader and it stays a cube with flat sides, no matter the tesselation factors (both PN and PNAEN). Makes sense if you use the axis-aligned normals and not averaged, like suggested several times (the bezier surfaces are indeed flat if all normals are equal). Maybe you stumbled across the same bug I did (vertex shader, not normalized normals therefore wrong control point calculation).

 

Edit: How does your PN behave for a nice model like a sphere ?

Edited by unbird
0

Share this post


Link to post
Share on other sites

I just fed a standard cube to my shader and it stays a cube with flat sides, no matter the tesselation factors (both PN and PNAEN). Makes sense if you use the axis-aligned normals and not averaged, like suggested several times (the bezier surfaces are indeed flat if all normals are equal).

At first I used a standard cube generated by Maya and the cube stayed flat exactly as you said. Then I changed the normals of the cube like this:

cubes.png

PN got the cracks as expected, but PN doesn't look smooth like in the graphic above and looks 100% like PN.

 Maybe you stumbled across the same bug I did (vertex shader, not normalized normals therefore wrong control point calculation).

I tried that, adding normalize in the Vertexshader, but no difference, still cracks.

 

Edit: How does your PN behave for a nice model like a sphere ?

Looks smooth, no cracks. No difference to flat tessealtion or PNAEN.

0

Share this post


Link to post
Share on other sites
OK, now I made you move in circles, sorry about that. I can only guess: Either your re-indexing goes wrong or the shader has a bug (well, not very helpful either, I know).
 
You might show your re-indexing code, maybe someone spots something. Also, my test case is probably too small. Can you put that cube up for download (preferably in a common exchange format like Wavefront) ? I'll run it through my reindexer and give you the results.
 
As for the shader: Cannot help you there, I'm really just a D3D guy wink.png. You might have more luck in the OpenGL forum. Though if you carefully translated it from the paper it should work (apart from the vertex shader bug).
0

Share this post


Link to post
Share on other sites

You might show your re-indexing code, maybe someone spots something. Also, my test case is probably too small.

 

Here is my indexing code:

void indexPNAEN(std::vector<unsigned short> indices, std::vector<glm::vec3> & in_vertices, std::vector<unsigned short> & out_indicesaen)
{
	out_indicesaen.resize(indices.size()*3); //step 1 Create an output IB that is 3 times the size of input IB.
	//step 2 c define edge
	struct Edge
	{
		glm::vec3 p[2];
		short ind[2];

		bool operator == (const Edge& o) const
		{
			if (ind[0] == o.ind[0] && ind[1] == o.ind[1])
				return true;

			if (p[0] == o.p[0] && p[1] == o.p[1])
			{

					return true;
			}

			return false;
		}

	/*	bool operator != (const Edge& o) const{
			return !(*this == o);
		}*/


		Edge reverse()
		{
			Edge returnedge;
			returnedge.p[0] = p[1];
			returnedge.p[1] = p[0];
			returnedge.ind[0] = ind[1];
			returnedge.ind[1] = ind[0];

			return returnedge;	
		}
	};

	struct KeyHasher
	{
		std::size_t operator()(const Edge& k) const
		{
			using boost::hash_value;
			using boost::hash_combine;

			// Start with a hash value of 0    .
			std::size_t seed = 0;

			// Modify 'seed' by XORing and bit-shifting in
			// one member of 'Key' after the other:
			for (int hashi = 0; hashi < 2; hashi++)
			{
				hash_combine(seed, hash_value(k.p[hashi].x));
				hash_combine(seed, hash_value(k.p[hashi].y));
				hash_combine(seed, hash_value(k.p[hashi].z));
				hash_combine(seed, hash_value(k.ind[hashi]));
			}

			// Return the result.
			return seed;
		}
	};



	std::unordered_map<Edge, Edge,KeyHasher> edges(indices.size()); 

	//step 2
	for (int i = 0; i < indices.size(); i += 3) //For each input Triangle in IB,
	{
		out_indicesaen[3 * i] = indices[i]; //i0
		out_indicesaen[3 * i + 1] = indices[i+1]; //i1
		out_indicesaen[3 * i + 2] = indices[i + 2]; //i2

		out_indicesaen[3 * i + 3] = indices[i]; //i0
		out_indicesaen[3 * i + 4] = indices[i + 1]; //i1
		out_indicesaen[3 * i + 5] = indices[i + 1]; //i1

		out_indicesaen[3 * i + 6] = indices[i+2]; //i2
		out_indicesaen[3 * i + 7] = indices[i + 2]; //i2
		out_indicesaen[3 * i + 8] = indices[i]; //i0

		//2b and 2d

		Edge edge0;
		edge0.p[0] = in_vertices[indices[i + 1]];
		edge0.p[1] = in_vertices[indices[i]];
		edge0.ind[1] = indices[indices[i]];
		edge0.ind[0] = indices[indices[i + 1]];
		edges.emplace(edge0.reverse(), edge0);

		Edge edge1;
		edge1.p[0] = in_vertices[indices[i + 2]];
		edge1.p[1] = in_vertices[indices[i + 1]];
		edge1.ind[1] = indices[indices[i + 1]];
		edge1.ind[0] = indices[indices[i + 2]];
		edges.emplace(edge1.reverse(), edge1);

		Edge edge2;
		edge2.p[0] = in_vertices[indices[i]];
		edge2.p[1] = in_vertices[indices[i + 2]];
		edge2.ind[1] = indices[indices[i + 2]];
		edge2.ind[0] = indices[indices[i]];
		edges.emplace(edge2.reverse(), edge2);
	}


	//step 3 Walk the output index buffer (OB) constructed in step 2. For each patch of 9 indices:
	for (int i = 3; i < out_indicesaen.size(); i += 9)
	{

		//3a For each Edge in the current Patch, perform a lookup into Edge->Edge mapping created in step 2d.
		for (int k = 0; k < 6; k += 2)
		{
			int i0 = out_indicesaen[i + k];
			int i1 = out_indicesaen[i + k + 1];
			Edge temp;
			temp.ind[0] = i1;
			temp.ind[1] = i0;
			temp.p[0] = in_vertices[i1];
			temp.p[1] = in_vertices[i0];

			auto foundIt = edges.find(temp);
			if (foundIt!=edges.end()) //look up in edge vector
			{
				const Edge& second = foundIt->second;
				out_indicesaen[i + k] = second.ind[1];
				out_indicesaen[i + k + 1] = second.ind[0];
				
			}

		}

	}

}

Can you put that cube up for download (preferably in a common exchange format like Wavefront) ? I'll run it through my reindexer and give you the results.

Oh, thank you! IThe cube can be downloaded here. (I'm not permitted to attach an .obj file blink.png ). I'm starting to get frustrated with PNAEN...I can't find the bug for two weeks now. It's part of my master thesis.

0

Share this post


Link to post
Share on other sites

Ok. Had to adjust the import (Assimp, join identical vertices), so only 24 instead of 36 distinct vertices. In any case, I included a dump of the vertices, so you could reconstruct the mesh programmatically. It's a bloated html-log (and the indices are dumped as tables and "raw" for easier copying).

 

From a quick glance, I think your reindexer is fine. 

 

Edit: Wait, try something first. Hash only the positions (x,y,z), the map will fail otherwise (at least it did for my C# dictionary).

2

Share this post


Link to post
Share on other sites

My reindexer is indeed wrong, I get totally different indices. I copied your indices manually into the vector and the cracks are gone! The shader works!

I'll try to hash only the positions.  I hope that's the bug! Thank you very much for your help, the html log is awesome!

 

Edit: I found out that my edge Map seems to be already wrong. i have only 32 entried while your map has 36 entries.

Edited by windschuetze
0

Share this post


Link to post
Share on other sites

I solved my problem! I had serveal bugs:

  • filling the edge map: indices[indices[i]] instead of indices[i]...

  • I removed the hashing of the index and it worked!

Thank you very much, I couldn't have done it without your help!

 

Now my cube looks smooth and crackfree:

screenshot16111.png

Edited by windschuetze
1

Share this post


Link to post
Share on other sites

 


It's Rocko!

Ah yes, haha, remember watching that in the mid-late 90's. Maybe worth a rewatch now that I'm old enough to actually understand it better than back then...

 

As for the displacement mapping I eventually settled on a rather simple approach for use with pre-existing triangle list meshes (it is by no means perfect but it seems that the "real" solution is really just having the 3D / texturing artist(s) being aware of your intents and have them author appropriately mapped bump maps and ensure corners actually are rounded, albeit with extremely short edges between corner vertices, as seemed to be the main point that the chapter in Zink, Pettineo & Hoxley (2011) as referred by unbird in the last post). Basically I average all disjoint vertex normals and create a 6-control patch index buffer that holds the initial triangle in the first 3 indices and then any "dominant" vertices sharing the position of these original vertices in the last 3 indices. The dominant vertices are arbitrarily chosen as the first found in the vertex data for a given position and are set to the same vertex as in the first three indices if there are no shared vertices at a given position. The dominant vertex is used to ensure that all overlapping vertices will sample the same value from the displacement map, while still allowing them to sample other textures by their UV coords.

Not perfect but good enough for some general-purpose examples.

As for actually employing this kind of displacement mapping in a more professional game / visual demo / what-have-you, the artist should ensure that there are *no* disjoint vertices (as said, such vertices can be moved slightly apart and be connected by a short edge, allowing the corners to appear mostly sharp) and a secondary set of texture coordinates should be provided for the displacement map / alternatively the displacement map should be handcrafted such that when displaced (with a reasonable strength / height factor), faces won't extrude through each others.

Of course there exists more elaborate ways as described in the previous posts, I just thought I would share this if anyone found it interesting, After tracking down a copy of that practical rendering book just for that tessellation chapter, it didn't say that much more about this particular problem, so might as well save others the trouble.

 

Hi,

im trying to implement the dominandt data, but I'm struggling again...I'm not sure how to understand the  GDC 2012 slides, when i'm generating the index buffer:

? Can use AEN edge data as well

vs:

? All shared vertices must have the same dominant data
? Both edge vertices must be from the same primitive

 

I tried with the PN AEN Indexbuffer adding 3 arbitrarly chosen vertices, but it didn't worked.

Then I found on the Maya Homepage a despription of a PNAEN 18 implementation using dominant data with a 18 size index buffer and I tried to adapt it. But the result isn't good either, the UVs doesn't look smoother:

 

screenshot0312.png

 

My index buffer now looks like this for unbirds example:

0,1,2,0,1,4,3,2,0,0,1,4,3,2,0,0,4,2,3,4,5,2,1,4,5,5,3,4,3,4,5,5,3,4,4,5

(See also xls Attachment for details).

I'm pretty sure that the shader interpolates right:

			float 
		uCorner =  (u == 1 ? 1:0),
		vCorner =  (v == 1 ? 1:0),
		wCorner =  (w == 1 ? 1:0),
		uEdge =    (u == 0 && (v * w)!=0 ? 1:0),
		vEdge =    (v == 0 && (u * w)!=0 ? 1:0),
		wEdge =    (w == 0 && (u * v)!=0 ? 1:0),
		interior = (u * v * w)!=0 ? 1:0;

		vec2 displaceCoord= 	uCorner*InPatch.domVert[0]
							+vCorner*InPatch.domVert[1]
							+wCorner*InPatch.domVert[2]
							+uEdge*mix(InPatch.domEdge0[1],InPatch.domEdge1[1],v)
							+vEdge*mix(InPatch.domEdge0[2],InPatch.domEdge1[2],w)
							+wEdge*mix(InPatch.domEdge0[0],InPatch.domEdge1[0],u)
							+interior*UV;

Any clue?

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

  • Similar Content

    • By YixunLiu
      Hi,
      I have a surface mesh and I want to use a cone to cut a hole on the surface mesh.
      Anybody know a fast method to calculate the intersected boundary of these two geometries?
       
      Thanks.
       
      YL
       
    • By hiya83
      Hi, I tried searching for this but either I failed or couldn't find anything. I know there's D11/D12 interop and there are extensions for GL/D11 (though not very efficient). I was wondering if there's any Vulkan/D11 or Vulkan/D12 interop?
      Thanks!
    • By lonewolff
      Hi Guys,
      I am just wondering if it is possible to acquire the address of the backbuffer if an API (based on DX11) only exposes the 'device' and 'context' pointers?
      Any advice would be greatly appreciated
    • By MarcusAseth
      bool InitDirect3D::Init() { if (!D3DApp::Init()) { return false; } //Additional Initialization //Disable Alt+Enter Fullscreen Toggle shortkey IDXGIFactory* factory; CreateDXGIFactory(__uuidof(IDXGIFactory), reinterpret_cast<void**>(&factory)); factory->MakeWindowAssociation(mhWindow, DXGI_MWA_NO_WINDOW_CHANGES); factory->Release(); return true; }  
      As stated on the title and displayed on the code above, regardless of it Alt+Enter still takes effect...
      I recall something from the book during the swapChain creation, where in order to create it one has to use the same factory used to create the ID3D11Device, therefore I tested and indeed using that same factory indeed it work.
      How is that one particular factory related to my window and how come the MakeWindowAssociation won't take effect with a newly created factory?
      Also what's even the point of being able to create this Factories if they won't work,?(except from that one associated with the ID3D11Device) 
    • By ProfL
      Can anyone recommend a wrapper for Direct3D 11 that is similarly simple to use as SFML? I don't need all the image formats etc. BUT I want a simple way to open a window, allocate a texture, buffer, shader.
  • Popular Now