QuadTrees and indices?

Started by
10 comments, last by ajoling 19 years, 7 months ago
After trying dozens of indexbuffer indexing variants, I got it.. I think ;)



This is just one quad.. Tommorow I'll probably implement the real stuff.. hopefully :).

Edit, I forgot I'd like to help people whoever have the same problem. Here is the index:

		pIndices[n++] = x + y * (m_wCols + 1);			pIndices[n++] = x + 1 + y * (m_wCols + 1);		        pIndices[n++] = x + 1 + (y + 1) * (m_wCols + 1);		pIndices[n++] = x + y * (m_wCols + 1);				pIndices[n++] = x + 1 + (y + 1) * (m_wCols + 1);		pIndices[n++] = x + (y + 1) * (m_wCols + 1);


[Edited by - ajoling on September 20, 2004 4:09:09 PM]
www.persistentrealities.com for Inline ASM for VB, VB Fibre, and other nice code samples in C++, PHP, ASP, etc.<br/>Play Yet Another Laser Game!<br/>
Advertisement
Hm, I think C++ is angry on me for never trying it before :).



That has only occured me once in VB, with multithreading.

As you can see above, I is both 91, but the values are different. In the compiled release exe it simply crashes. if I run release through the IDE (or debug) it will run. Debug exe will also run...


Also, vajuras: If you read this topic: how do you get the vertices start point and the amount of vertices? It produces strange results for me, if I calculate them :).

www.persistentrealities.com for Inline ASM for VB, VB Fibre, and other nice code samples in C++, PHP, ASP, etc.<br/>Play Yet Another Laser Game!<br/>

This topic is closed to new replies.

Advertisement