o3dgcCommon.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412
  1. /*
  2. Copyright (c) 2013 Khaled Mammou - Advanced Micro Devices, Inc.
  3. Permission is hereby granted, free of charge, to any person obtaining a copy
  4. of this software and associated documentation files (the "Software"), to deal
  5. in the Software without restriction, including without limitation the rights
  6. to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  7. copies of the Software, and to permit persons to whom the Software is
  8. furnished to do so, subject to the following conditions:
  9. The above copyright notice and this permission notice shall be included in
  10. all copies or substantial portions of the Software.
  11. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  12. IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  13. FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  14. AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  15. LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  16. OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  17. THE SOFTWARE.
  18. */
  19. #pragma once
  20. #ifndef O3DGC_COMMON_H
  21. #define O3DGC_COMMON_H
  22. #ifndef _CRT_SECURE_NO_WARNINGS
  23. #define _CRT_SECURE_NO_WARNINGS
  24. #endif
  25. #include <stdio.h>
  26. #include <string.h>
  27. #include <assert.h>
  28. #include <math.h>
  29. namespace o3dgc
  30. {
  31. typedef float Real;
  32. const double O3DGC_MAX_DOUBLE = 1.79769e+308;
  33. const long O3DGC_MIN_LONG = -2147483647;
  34. const long O3DGC_MAX_LONG = 2147483647;
  35. const long O3DGC_MAX_UCHAR8 = 255;
  36. const long O3DGC_MAX_TFAN_SIZE = 256;
  37. const unsigned long O3DGC_MAX_ULONG = 4294967295;
  38. const unsigned long O3DGC_SC3DMC_START_CODE = 0x00001F1;
  39. const unsigned long O3DGC_DV_START_CODE = 0x00001F2;
  40. const unsigned long O3DGC_SC3DMC_MAX_NUM_FLOAT_ATTRIBUTES = 256;
  41. const unsigned long O3DGC_SC3DMC_MAX_NUM_INT_ATTRIBUTES = 256;
  42. const unsigned long O3DGC_SC3DMC_MAX_DIM_ATTRIBUTES = 32;
  43. const unsigned long O3DGC_SC3DMC_MAX_PREDICTION_NEIGHBORS = 2;
  44. const unsigned long O3DGC_SC3DMC_MAX_PREDICTION_SYMBOLS = 257;
  45. enum O3DGCEndianness
  46. {
  47. O3DGC_BIG_ENDIAN = 0,
  48. O3DGC_LITTLE_ENDIAN = 1
  49. };
  50. enum O3DGCErrorCode
  51. {
  52. O3DGC_OK,
  53. O3DGC_ERROR_BUFFER_FULL,
  54. O3DGC_ERROR_CREATE_FILE,
  55. O3DGC_ERROR_OPEN_FILE,
  56. O3DGC_ERROR_READ_FILE,
  57. O3DGC_ERROR_CORRUPTED_STREAM,
  58. O3DGC_ERROR_NON_SUPPORTED_FEATURE
  59. };
  60. enum O3DGCSC3DMCBinarization
  61. {
  62. O3DGC_SC3DMC_BINARIZATION_FL = 0, // Fixed Length (not supported)
  63. O3DGC_SC3DMC_BINARIZATION_BP = 1, // BPC (not supported)
  64. O3DGC_SC3DMC_BINARIZATION_FC = 2, // 4 bits Coding (not supported)
  65. O3DGC_SC3DMC_BINARIZATION_AC = 3, // Arithmetic Coding (not supported)
  66. O3DGC_SC3DMC_BINARIZATION_AC_EGC = 4, // Arithmetic Coding & EGCk
  67. O3DGC_SC3DMC_BINARIZATION_ASCII = 5 // Arithmetic Coding & EGCk
  68. };
  69. enum O3DGCStreamType
  70. {
  71. O3DGC_STREAM_TYPE_UNKOWN = 0,
  72. O3DGC_STREAM_TYPE_ASCII = 1,
  73. O3DGC_STREAM_TYPE_BINARY = 2
  74. };
  75. enum O3DGCSC3DMCQuantizationMode
  76. {
  77. O3DGC_SC3DMC_DIAG_BB = 0, // supported
  78. O3DGC_SC3DMC_MAX_ALL_DIMS = 1, // supported
  79. O3DGC_SC3DMC_MAX_SEP_DIM = 2 // supported
  80. };
  81. enum O3DGCSC3DMCPredictionMode
  82. {
  83. O3DGC_SC3DMC_NO_PREDICTION = 0, // supported
  84. O3DGC_SC3DMC_DIFFERENTIAL_PREDICTION = 1, // supported
  85. O3DGC_SC3DMC_XOR_PREDICTION = 2, // not supported
  86. O3DGC_SC3DMC_ADAPTIVE_DIFFERENTIAL_PREDICTION = 3, // not supported
  87. O3DGC_SC3DMC_CIRCULAR_DIFFERENTIAL_PREDICTION = 4, // not supported
  88. O3DGC_SC3DMC_PARALLELOGRAM_PREDICTION = 5, // supported
  89. O3DGC_SC3DMC_SURF_NORMALS_PREDICTION = 6 // supported
  90. };
  91. enum O3DGCSC3DMCEncodingMode
  92. {
  93. O3DGC_SC3DMC_ENCODE_MODE_QBCR = 0, // not supported
  94. O3DGC_SC3DMC_ENCODE_MODE_SVA = 1, // not supported
  95. O3DGC_SC3DMC_ENCODE_MODE_TFAN = 2, // supported
  96. };
  97. enum O3DGCDVEncodingMode
  98. {
  99. O3DGC_DYNAMIC_VECTOR_ENCODE_MODE_LIFT = 0
  100. };
  101. enum O3DGCIFSFloatAttributeType
  102. {
  103. O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_UNKOWN = 0,
  104. O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_POSITION = 1,
  105. O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_NORMAL = 2,
  106. O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_COLOR = 3,
  107. O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_TEXCOORD = 4,
  108. O3DGC_IFS_FLOAT_ATTRIBUTE_TYPE_WEIGHT = 5
  109. };
  110. enum O3DGCIFSIntAttributeType
  111. {
  112. O3DGC_IFS_INT_ATTRIBUTE_TYPE_UNKOWN = 0,
  113. O3DGC_IFS_INT_ATTRIBUTE_TYPE_INDEX = 1,
  114. O3DGC_IFS_INT_ATTRIBUTE_TYPE_JOINT_ID = 2,
  115. O3DGC_IFS_INT_ATTRIBUTE_TYPE_INDEX_BUFFER_ID = 3
  116. };
  117. template<class T>
  118. inline const T absolute(const T& a)
  119. {
  120. return (a < (T)(0)) ? -a : a;
  121. }
  122. template<class T>
  123. inline const T min(const T& a, const T& b)
  124. {
  125. return (b < a) ? b : a;
  126. }
  127. template<class T>
  128. inline const T max(const T& a, const T& b)
  129. {
  130. return (b > a) ? b : a;
  131. }
  132. template<class T>
  133. inline void swap(T& a, T& b)
  134. {
  135. T tmp = a;
  136. a = b;
  137. b = tmp;
  138. }
  139. inline double log2( double n )
  140. {
  141. return log(n) / log(2.0);
  142. }
  143. inline O3DGCEndianness SystemEndianness()
  144. {
  145. unsigned long num = 1;
  146. return ( *((char *)(&num)) == 1 )? O3DGC_LITTLE_ENDIAN : O3DGC_BIG_ENDIAN ;
  147. }
  148. class SC3DMCStats
  149. {
  150. public:
  151. SC3DMCStats(void)
  152. {
  153. memset(this, 0, sizeof(SC3DMCStats));
  154. };
  155. ~SC3DMCStats(void){};
  156. double m_timeCoord;
  157. double m_timeNormal;
  158. double m_timeCoordIndex;
  159. double m_timeFloatAttribute[O3DGC_SC3DMC_MAX_NUM_FLOAT_ATTRIBUTES];
  160. double m_timeIntAttribute [O3DGC_SC3DMC_MAX_NUM_INT_ATTRIBUTES ];
  161. double m_timeReorder;
  162. unsigned long m_streamSizeCoord;
  163. unsigned long m_streamSizeNormal;
  164. unsigned long m_streamSizeCoordIndex;
  165. unsigned long m_streamSizeFloatAttribute[O3DGC_SC3DMC_MAX_NUM_FLOAT_ATTRIBUTES];
  166. unsigned long m_streamSizeIntAttribute [O3DGC_SC3DMC_MAX_NUM_INT_ATTRIBUTES ];
  167. };
  168. typedef struct
  169. {
  170. long m_a;
  171. long m_b;
  172. long m_c;
  173. } SC3DMCTriplet;
  174. typedef struct
  175. {
  176. SC3DMCTriplet m_id;
  177. long m_pred[O3DGC_SC3DMC_MAX_DIM_ATTRIBUTES];
  178. } SC3DMCPredictor;
  179. inline bool operator< (const SC3DMCTriplet& lhs, const SC3DMCTriplet& rhs)
  180. {
  181. if (lhs.m_c != rhs.m_c)
  182. {
  183. return (lhs.m_c < rhs.m_c);
  184. }
  185. else if (lhs.m_b != rhs.m_b)
  186. {
  187. return (lhs.m_b < rhs.m_b);
  188. }
  189. return (lhs.m_a < rhs.m_a);
  190. }
  191. inline bool operator== (const SC3DMCTriplet& lhs, const SC3DMCTriplet& rhs)
  192. {
  193. return (lhs.m_c == rhs.m_c && lhs.m_b == rhs.m_b && lhs.m_a == rhs.m_a);
  194. }
  195. // fix me: optimize this function (e.g., binary search)
  196. inline unsigned long Insert(SC3DMCTriplet e, unsigned long & nPred, SC3DMCPredictor * const list)
  197. {
  198. unsigned long pos = 0xFFFFFFFF;
  199. bool foundOrInserted = false;
  200. for (unsigned long j = 0; j < nPred; ++j)
  201. {
  202. if (e == list[j].m_id)
  203. {
  204. foundOrInserted = true;
  205. break;
  206. }
  207. else if (e < list[j].m_id)
  208. {
  209. if (nPred < O3DGC_SC3DMC_MAX_PREDICTION_NEIGHBORS)
  210. {
  211. ++nPred;
  212. }
  213. for (unsigned long h = nPred-1; h > j; --h)
  214. {
  215. list[h] = list[h-1];
  216. }
  217. list[j].m_id = e;
  218. pos = j;
  219. foundOrInserted = true;
  220. break;
  221. }
  222. }
  223. if (!foundOrInserted && nPred < O3DGC_SC3DMC_MAX_PREDICTION_NEIGHBORS)
  224. {
  225. pos = nPred;
  226. list[nPred++].m_id = e;
  227. }
  228. return pos;
  229. }
  230. template <class T>
  231. inline void SphereToCube(const T x, const T y, const T z,
  232. T & a, T & b, char & index)
  233. {
  234. T ax = absolute(x);
  235. T ay = absolute(y);
  236. T az = absolute(z);
  237. if (az >= ax && az >= ay)
  238. {
  239. if (z >= (T)(0))
  240. {
  241. index = 0;
  242. a = x;
  243. b = y;
  244. }
  245. else
  246. {
  247. index = 1;
  248. a = -x;
  249. b = -y;
  250. }
  251. }
  252. else if (ay >= ax && ay >= az)
  253. {
  254. if (y >= (T)(0))
  255. {
  256. index = 2;
  257. a = z;
  258. b = x;
  259. }
  260. else
  261. {
  262. index = 3;
  263. a = -z;
  264. b = -x;
  265. }
  266. }
  267. else if (ax >= ay && ax >= az)
  268. {
  269. if (x >= (T)(0))
  270. {
  271. index = 4;
  272. a = y;
  273. b = z;
  274. }
  275. else
  276. {
  277. index = 5;
  278. a = -y;
  279. b = -z;
  280. }
  281. }
  282. }
  283. inline void CubeToSphere(const Real a, const Real b, const char index,
  284. Real & x, Real & y, Real & z)
  285. {
  286. switch( index )
  287. {
  288. case 0:
  289. x = a;
  290. y = b;
  291. z = (Real) sqrt(max(0.0, 1.0 - x*x-y*y));
  292. break;
  293. case 1:
  294. x = -a;
  295. y = -b;
  296. z = -(Real) sqrt(max(0.0, 1.0 - x*x-y*y));
  297. break;
  298. case 2:
  299. z = a;
  300. x = b;
  301. y = (Real) sqrt(max(0.0, 1.0 - x*x-z*z));
  302. break;
  303. case 3:
  304. z = -a;
  305. x = -b;
  306. y = -(Real) sqrt(max(0.0, 1.0 - x*x-z*z));
  307. break;
  308. case 4:
  309. y = a;
  310. z = b;
  311. x = (Real) sqrt(max(0.0, 1.0 - y*y-z*z));
  312. break;
  313. case 5:
  314. y = -a;
  315. z = -b;
  316. x = -(Real) sqrt(max(0.0, 1.0 - y*y-z*z));
  317. break;
  318. }
  319. }
  320. inline unsigned long IntToUInt(long value)
  321. {
  322. return (value < 0)?(unsigned long) (-1 - (2 * value)):(unsigned long) (2 * value);
  323. }
  324. inline long UIntToInt(unsigned long uiValue)
  325. {
  326. return (uiValue & 1)?-((long) ((uiValue+1) >> 1)):((long) (uiValue >> 1));
  327. }
  328. inline void ComputeVectorMinMax(const Real * const tab,
  329. unsigned long size,
  330. unsigned long dim,
  331. unsigned long stride,
  332. Real * minTab,
  333. Real * maxTab,
  334. O3DGCSC3DMCQuantizationMode quantMode)
  335. {
  336. if (size == 0 || dim == 0)
  337. {
  338. return;
  339. }
  340. unsigned long p = 0;
  341. for(unsigned long d = 0; d < dim; ++d)
  342. {
  343. maxTab[d] = minTab[d] = tab[p++];
  344. }
  345. p = stride;
  346. for(unsigned long i = 1; i < size; ++i)
  347. {
  348. for(unsigned long d = 0; d < dim; ++d)
  349. {
  350. if (maxTab[d] < tab[p+d]) maxTab[d] = tab[p+d];
  351. if (minTab[d] > tab[p+d]) minTab[d] = tab[p+d];
  352. }
  353. p += stride;
  354. }
  355. if (quantMode == O3DGC_SC3DMC_DIAG_BB)
  356. {
  357. Real diag = 0.0;
  358. Real r;
  359. for(unsigned long d = 0; d < dim; ++d)
  360. {
  361. r = (maxTab[d] - minTab[d]);
  362. diag += r*r;
  363. }
  364. diag = sqrt(diag);
  365. for(unsigned long d = 0; d < dim; ++d)
  366. {
  367. maxTab[d] = minTab[d] + diag;
  368. }
  369. }
  370. else if (quantMode == O3DGC_SC3DMC_MAX_ALL_DIMS)
  371. {
  372. Real maxr = (maxTab[0] - minTab[0]);
  373. Real r;
  374. for(unsigned long d = 1; d < dim; ++d)
  375. {
  376. r = (maxTab[d] - minTab[d]);
  377. if ( r > maxr)
  378. {
  379. maxr = r;
  380. }
  381. }
  382. for(unsigned long d = 0; d < dim; ++d)
  383. {
  384. maxTab[d] = minTab[d] + maxr;
  385. }
  386. }
  387. }
  388. }
  389. #endif // O3DGC_COMMON_H