Level2.cpp 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310
  1. #include "stdafx.h"
  2. #include "Level2.h"
  3. #include <memory>
  4. using namespace SparseVoxelTreePerformanceTest;
  5. int SparseVoxelTreePerformanceTest::EncodeIndex(int x, int y, int z)
  6. {
  7. return (z << 2) + (y << 1) + x;
  8. }
  9. Level4::Level4(unsigned char x, unsigned char y, unsigned char z, int voxel)
  10. : X(x), Y(y), Z(z), Voxel(voxel), Children(nullptr)
  11. {}
  12. Level4::~Level4()
  13. {
  14. if (Children != nullptr)
  15. delete [] Children;
  16. }
  17. void Level4::Subdivide()
  18. {
  19. Children = new unsigned int[4 * 4 * 4];
  20. memset(Children, Voxel, 4 * 4 * 4);
  21. }
  22. int Level4::GetVoxel(unsigned char x, unsigned char y, unsigned char z)
  23. {
  24. if (Children == nullptr)
  25. return Voxel;
  26. return Children[EncodeIndex(x, y, z)];
  27. }
  28. void Level4::SetVoxel(unsigned char x, unsigned char y, unsigned char z, int voxel)
  29. {
  30. if (Children == nullptr)
  31. {
  32. if (Voxel == voxel)
  33. return;
  34. Subdivide();
  35. }
  36. Children[EncodeIndex(x, y, z)] = voxel;
  37. }
  38. int Level4::EncodeIndex(unsigned char x, unsigned char y, unsigned char z)
  39. {
  40. int _x = (x - X);// &0x3;
  41. int _y = (y - Y);// &0x3;
  42. int _z = (z - Z);// &0x3;
  43. return (_z << 4) + (_y << 2) + _x;
  44. }
  45. Level8::Level8(unsigned char x, unsigned char y, unsigned char z, int voxel)
  46. : X(x), Y(y), Z(z), Voxel(voxel), Children(nullptr)
  47. {}
  48. Level8::~Level8()
  49. {
  50. if (Children != nullptr)
  51. delete[] Children;
  52. }
  53. void Level8::Subdivide()
  54. {
  55. Children = new Level4[8]
  56. {
  57. Level4(X, Y, Z, Voxel),
  58. Level4(X + 4, Y, Z, Voxel),
  59. Level4(X, Y + 4, Z, Voxel),
  60. Level4(X + 4, Y + 4, Z, Voxel),
  61. Level4(X, Y, Z + 4, Voxel),
  62. Level4(X + 4, Y, Z + 4, Voxel),
  63. Level4(X, Y + 4, Z + 4, Voxel),
  64. Level4(X + 4, Y + 4, Z + 4, Voxel)
  65. };
  66. }
  67. int Level8::GetVoxel(unsigned char x, unsigned char y, unsigned char z)
  68. {
  69. if (Children == nullptr)
  70. return Voxel;
  71. return Children[EncodeIndex(x, y, z)].GetVoxel(x, y, z);
  72. }
  73. void Level8::SetVoxel(unsigned char x, unsigned char y, unsigned char z, int voxel)
  74. {
  75. if (Children == nullptr)
  76. {
  77. if (Voxel == voxel)
  78. return;
  79. Subdivide();
  80. }
  81. Children[EncodeIndex(x, y, z)].SetVoxel(x, y, z, voxel);
  82. }
  83. int Level8::EncodeIndex(unsigned char x, unsigned char y, unsigned char z)
  84. {
  85. int _x = ((x - X) >> 2);// &0x1;
  86. int _y = ((y - Y) >> 2);// &0x1;
  87. int _z = ((z - Z) >> 2);// &0x1;
  88. return SparseVoxelTreePerformanceTest::EncodeIndex(_x, _y, _z);
  89. }
  90. Level16::Level16(unsigned char x, unsigned char y, unsigned char z, int voxel)
  91. : X(x), Y(y), Z(z), Voxel(voxel), Children(nullptr)
  92. {}
  93. Level16::~Level16()
  94. {
  95. if (Children != nullptr)
  96. delete[] Children;
  97. }
  98. void Level16::Subdivide()
  99. {
  100. Children = new Level8[8]
  101. {
  102. Level8(X, Y, Z, Voxel),
  103. Level8(X + 8, Y, Z, Voxel),
  104. Level8(X, Y + 8, Z, Voxel),
  105. Level8(X + 8, Y + 8, Z, Voxel),
  106. Level8(X, Y, Z + 8, Voxel),
  107. Level8(X + 8, Y, Z + 8, Voxel),
  108. Level8(X, Y + 8, Z + 8, Voxel),
  109. Level8(X + 8, Y + 8, Z + 8, Voxel)
  110. };
  111. }
  112. int Level16::GetVoxel(unsigned char x, unsigned char y, unsigned char z)
  113. {
  114. if (Children == nullptr)
  115. return Voxel;
  116. return Children[EncodeIndex(x, y, z)].GetVoxel(x, y, z);
  117. }
  118. void Level16::SetVoxel(unsigned char x, unsigned char y, unsigned char z, int voxel)
  119. {
  120. if (Children == nullptr)
  121. {
  122. if (Voxel == voxel)
  123. return;
  124. Subdivide();
  125. }
  126. Children[EncodeIndex(x, y, z)].SetVoxel(x, y, z, voxel);
  127. }
  128. int Level16::EncodeIndex(unsigned char x, unsigned char y, unsigned char z)
  129. {
  130. int _x = ((x - X) >> 3);// &0x1;
  131. int _y = ((y - Y) >> 3);// &0x1;
  132. int _z = ((z - Z) >> 3);// &0x1;
  133. return SparseVoxelTreePerformanceTest::EncodeIndex(_x, _y, _z);
  134. }
  135. Chunk::Chunk(int voxel)
  136. : Voxel(voxel), Children(nullptr)
  137. {}
  138. Chunk::~Chunk()
  139. {
  140. if (Children != nullptr)
  141. delete[] Children;
  142. }
  143. void Chunk::Subdivide()
  144. {
  145. Children = new Level16[4]
  146. {
  147. Level16(0, 0, 0, Voxel),
  148. Level16(0, 16, 0, Voxel),
  149. Level16(0, 32, 0, Voxel),
  150. Level16(0, 48, 0, Voxel),
  151. };
  152. }
  153. int Chunk::GetVoxel(unsigned char x, unsigned char y, unsigned char z)
  154. {
  155. if (Children == nullptr)
  156. return Voxel;
  157. return Children[EncodeIndex(x, y, z)].GetVoxel(x, y, z);
  158. }
  159. void Chunk::SetVoxel(unsigned char x, unsigned char y, unsigned char z, int voxel)
  160. {
  161. if (Children == nullptr)
  162. {
  163. if (Voxel == voxel)
  164. return;
  165. Subdivide();
  166. }
  167. Children[EncodeIndex(x, y, z)].SetVoxel(x, y, z, voxel);
  168. }
  169. int Chunk::EncodeIndex(unsigned char x, unsigned char y, unsigned char z)
  170. {
  171. return (y >> 4);// &0x3;
  172. }
  173. int Level4::GetMemoryUsage()
  174. {
  175. return sizeof(Level4) + (Children == nullptr ? 0 : (sizeof(unsigned int) * 4 * 4 * 4));
  176. }
  177. int Level8::GetMemoryUsage()
  178. {
  179. int bytesUsed = sizeof(Level8);
  180. if (Children != nullptr)
  181. for (int i = 0; i < 8; ++i)
  182. bytesUsed += Children[i].GetMemoryUsage();
  183. return bytesUsed;
  184. }
  185. int Level16::GetMemoryUsage()
  186. {
  187. int bytesUsed = sizeof(Level16);
  188. if (Children != nullptr)
  189. for (int i = 0; i < 8; ++i)
  190. bytesUsed += Children[i].GetMemoryUsage();
  191. return bytesUsed;
  192. }
  193. int Chunk::GetMemoryUsage()
  194. {
  195. int bytesUsed = 8;// sizeof(Chunk);
  196. if (Children != nullptr)
  197. for (int i = 0; i < 4; ++i)
  198. bytesUsed += Children[i].GetMemoryUsage();
  199. return bytesUsed;
  200. }
  201. bool Level4::Compact()
  202. {
  203. if (Children == nullptr)
  204. return true;
  205. unsigned int v = Children[0];
  206. for (int i = 1; i < (4 * 4 * 4); ++i)
  207. if (Children[i] != v) return false;
  208. Voxel = v;
  209. delete[] Children;
  210. Children = nullptr;
  211. return true;
  212. }
  213. bool Level8::Compact()
  214. {
  215. if (Children == nullptr)
  216. return true;
  217. unsigned int v = Children[0].Voxel;
  218. bool childrenCompact = true;
  219. for (int i = 0; i < 8; ++i)
  220. {
  221. childrenCompact &= Children[i].Compact();
  222. childrenCompact &= (Children[i].Voxel == v);
  223. }
  224. if (childrenCompact)
  225. {
  226. delete[] Children;
  227. Children = nullptr;
  228. Voxel = v;
  229. return true;
  230. }
  231. return false;
  232. }
  233. bool Level16::Compact()
  234. {
  235. if (Children == nullptr)
  236. return true;
  237. unsigned int v = Children[0].Voxel;
  238. bool childrenCompact = true;
  239. for (int i = 0; i < 8; ++i)
  240. {
  241. childrenCompact &= Children[i].Compact();
  242. childrenCompact &= (Children[i].Voxel == v);
  243. }
  244. if (childrenCompact)
  245. {
  246. delete[] Children;
  247. Children = nullptr;
  248. Voxel = v;
  249. return true;
  250. }
  251. return false;
  252. }
  253. void Chunk::Compact()
  254. {
  255. if (Children == nullptr)
  256. return;
  257. unsigned int v = Children[0].Voxel;
  258. bool childrenCompact = true;
  259. for (int i = 0; i < 4; ++i)
  260. {
  261. childrenCompact &= Children[i].Compact();
  262. childrenCompact &= (Children[i].Voxel == v);
  263. }
  264. if (childrenCompact)
  265. {
  266. delete[] Children;
  267. Children = nullptr;
  268. Voxel = v;
  269. }
  270. }