morton.hpp 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245
  1. #ifndef _SCTL_MORTON_
  2. #define _SCTL_MORTON_
  3. #include <sctl/common.hpp>
  4. #include SCTL_INCLUDE(math_utils.hpp)
  5. #include <cstdint>
  6. #ifndef SCTL_MAX_DEPTH
  7. #define SCTL_MAX_DEPTH 15
  8. #endif
  9. namespace SCTL_NAMESPACE {
  10. template <class ValueType> class Vector;
  11. template <Integer DIM = 3> class Morton {
  12. public:
  13. #if SCTL_MAX_DEPTH < 7
  14. typedef uint8_t UINT_T;
  15. #elif SCTL_MAX_DEPTH < 15
  16. typedef uint16_t UINT_T;
  17. #elif SCTL_MAX_DEPTH < 31
  18. typedef uint32_t UINT_T;
  19. #elif SCTL_MAX_DEPTH < 63
  20. typedef uint64_t UINT_T;
  21. #endif
  22. static constexpr Integer MAX_DEPTH = SCTL_MAX_DEPTH;
  23. static constexpr Integer MaxDepth() {
  24. return MAX_DEPTH;
  25. }
  26. Morton() {
  27. depth = 0;
  28. for (Integer i = 0; i < DIM; i++) x[i] = 0;
  29. }
  30. template <class T> explicit Morton(ConstIterator<T> coord, uint8_t depth_ = MAX_DEPTH) {
  31. depth = depth_;
  32. SCTL_ASSERT(depth <= MAX_DEPTH);
  33. UINT_T mask = ~((((UINT_T)1) << (MAX_DEPTH - depth)) - 1);
  34. for (Integer i = 0; i < DIM; i++) x[i] = mask & (UINT_T)floor((double)coord[i] * maxCoord);
  35. }
  36. uint8_t Depth() const { return depth; }
  37. template <class T> void Coord(Iterator<T> coord) const {
  38. static const T s = 1.0 / ((T)maxCoord);
  39. for (Integer i = 0; i < DIM; i++) coord[i] = (T)x[i] * s;
  40. }
  41. Morton Next() const {
  42. UINT_T mask = ((UINT_T)1) << (MAX_DEPTH - depth);
  43. Integer d, i;
  44. Morton m = *this;
  45. for (d = depth; d >= 0; d--) {
  46. for (i = 0; i < DIM; i++) {
  47. m.x[i] = (m.x[i] ^ mask);
  48. if ((m.x[i] & mask)) break;
  49. }
  50. if (i < DIM) break;
  51. mask = (mask << 1);
  52. }
  53. if (d < 0) d = 0;
  54. m.depth = (uint8_t)d;
  55. return m;
  56. }
  57. Morton Ancestor(uint8_t ancestor_level) const {
  58. UINT_T mask = ~((((UINT_T)1) << (MAX_DEPTH - ancestor_level)) - 1);
  59. Morton m;
  60. for (Integer i = 0; i < DIM; i++) m.x[i] = x[i] & mask;
  61. m.depth = ancestor_level;
  62. return m;
  63. }
  64. /**
  65. * \brief Returns the deepest first descendant.
  66. */
  67. Morton DFD(uint8_t level = MAX_DEPTH) const {
  68. Morton m = *this;
  69. m.depth = level;
  70. return m;
  71. }
  72. void NbrList(Vector<Morton> &nlst, uint8_t level, bool periodic) const {
  73. static constexpr Integer MAX_NBRS = sctl::pow<DIM,Integer>(3);
  74. StaticArray<Morton<DIM>,MAX_NBRS> nbrs;
  75. Integer Nnbrs = 0;
  76. UINT_T mask = ~((((UINT_T)1) << (MAX_DEPTH - level)) - 1);
  77. for (Integer i = 0; i < DIM; i++) nbrs[0].x[i] = x[i] & mask;
  78. nbrs[0].depth = level;
  79. Nnbrs++;
  80. Morton m;
  81. Integer k = 1;
  82. mask = (((UINT_T)1) << (MAX_DEPTH - level));
  83. if (periodic) {
  84. for (Integer i = 0; i < DIM; i++) {
  85. for (Integer j = 0; j < k; j++) {
  86. m = nbrs[j];
  87. m.x[i] = (m.x[i] + mask) & (maxCoord - 1);
  88. nbrs[Nnbrs] = m;
  89. Nnbrs++;
  90. }
  91. for (Integer j = 0; j < k; j++) {
  92. m = nbrs[j];
  93. m.x[i] = (m.x[i] - mask) & (maxCoord - 1);
  94. nbrs[Nnbrs] = m;
  95. Nnbrs++;
  96. }
  97. k = Nnbrs;
  98. }
  99. } else {
  100. for (Integer i = 0; i < DIM; i++) {
  101. for (Integer j = 0; j < k; j++) {
  102. m = nbrs[j];
  103. if (m.x[i] + mask < maxCoord) {
  104. m.x[i] += mask;
  105. nbrs[Nnbrs] = m;
  106. Nnbrs++;
  107. }
  108. }
  109. for (Integer j = 0; j < k; j++) {
  110. m = nbrs[j];
  111. if (m.x[i] >= mask) {
  112. m.x[i] -= mask;
  113. nbrs[Nnbrs] = m;
  114. Nnbrs++;
  115. }
  116. }
  117. k = Nnbrs;
  118. }
  119. }
  120. if (nlst.Dim() != Nnbrs) {
  121. nlst.ReInit(Nnbrs, nbrs);
  122. } else {
  123. for (Integer i = 0; i < Nnbrs; i++) {
  124. nlst[i] = nbrs[i];
  125. }
  126. }
  127. }
  128. void Children(Vector<Morton> &nlst) const {
  129. static const Integer cnt = (1UL << DIM);
  130. if (nlst.Dim() != cnt) nlst.ReInit(cnt);
  131. for (Integer i = 0; i < DIM; i++) nlst[0].x[i] = x[i];
  132. nlst[0].depth = (uint8_t)(depth + 1);
  133. Integer k = 1;
  134. UINT_T mask = (((UINT_T)1) << (MAX_DEPTH - (depth + 1)));
  135. for (Integer i = 0; i < DIM; i++) {
  136. for (Integer j = 0; j < k; j++) {
  137. nlst[j + k] = nlst[j];
  138. nlst[j + k].x[i] += mask;
  139. }
  140. k = (k << 1);
  141. }
  142. }
  143. bool operator<(const Morton &m) const {
  144. UINT_T diff = 0;
  145. for (Integer i = 0; i < DIM; i++) diff = diff | (x[i] ^ m.x[i]);
  146. if (!diff) return depth < m.depth;
  147. UINT_T mask = 1;
  148. for (Integer i = 4 * sizeof(UINT_T); i > 0; i = (i >> 1)) {
  149. UINT_T mask_ = (mask << i);
  150. if (mask_ <= diff) mask = mask_;
  151. }
  152. for (Integer i = DIM - 1; i >= 0; i--) {
  153. if (mask & (x[i] ^ m.x[i])) return x[i] < m.x[i];
  154. }
  155. return false; // TODO: check
  156. }
  157. bool operator>(const Morton &m) const { return m < (*this); }
  158. bool operator!=(const Morton &m) const {
  159. for (Integer i = 0; i < DIM; i++)
  160. if (x[i] != m.x[i]) return true;
  161. return (depth != m.depth);
  162. }
  163. bool operator==(const Morton &m) const { return !(*this != m); }
  164. bool operator<=(const Morton &m) const { return !(*this > m); }
  165. bool operator>=(const Morton &m) const { return !(*this < m); }
  166. bool isAncestor(Morton const &descendant) const { return descendant.depth > depth && descendant.Ancestor(depth) == *this; }
  167. Long operator-(const Morton<DIM> &I) const {
  168. // Intersecting -1
  169. // Touching 0
  170. Long offset0 = 1 << (MAX_DEPTH - depth - 1);
  171. Long offset1 = 1 << (MAX_DEPTH - I.depth - 1);
  172. Long diff = 0;
  173. for (Integer i = 0; i < DIM; i++) {
  174. diff = std::max<Long>(diff, abs(((Long)x[i] + offset0) - ((Long)I.x[i] + offset1)));
  175. }
  176. if (diff < offset0 + offset1) return -1;
  177. Integer max_depth = std::max(depth, I.depth);
  178. diff = (diff - offset0 - offset1) >> (MAX_DEPTH - max_depth);
  179. return diff;
  180. }
  181. friend std::ostream &operator<<(std::ostream &out, const Morton &mid) {
  182. double a = 0;
  183. double s = 1u << DIM;
  184. for (Integer j = MAX_DEPTH; j >= 0; j--) {
  185. for (Integer i = DIM - 1; i >= 0; i--) {
  186. s = s * 0.5;
  187. if (mid.x[i] & (((UINT_T)1) << j)) a += s;
  188. }
  189. }
  190. out << "(";
  191. for (Integer i = 0; i < DIM; i++) {
  192. out << mid.x[i] * 1.0 / maxCoord << ",";
  193. }
  194. out << (int)mid.depth << "," << a << ")";
  195. return out;
  196. }
  197. private:
  198. static constexpr UINT_T maxCoord = ((UINT_T)1) << (MAX_DEPTH);
  199. // StaticArray<UINT_T,DIM> x;
  200. UINT_T x[DIM];
  201. uint8_t depth;
  202. };
  203. }
  204. #endif //_SCTL_MORTON_