import_obj.ts 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153
  1. function import_obj_run(path: string, replace_existing: bool = true) {
  2. let i: split_type_t = context_raw.split_by;
  3. let is_udim: bool = i == split_type_t.UDIM;
  4. let split_code: i32 = (i == split_type_t.OBJECT || is_udim) ? char_code_at("o", 0)
  5. : i == split_type_t.GROUP ? char_code_at("g", 0)
  6. : char_code_at("u", 0); // usemtl
  7. let b: buffer_t = data_get_blob(path);
  8. if (is_udim) {
  9. let part: raw_mesh_t = obj_parse(b, split_code, 0, is_udim);
  10. let name: string = part.name;
  11. for (let i: i32 = 0; i < part.udims.length; ++i) {
  12. let a: u32_array_t = part.udims[i];
  13. if (a.length == 0) {
  14. continue;
  15. }
  16. let u: i32 = i % part.udims_u;
  17. let v: i32 = math_floor(i / part.udims_u);
  18. let id: i32 = (1000 + v * 10 + u + 1);
  19. part.name = name + "." + id;
  20. part.inda = a;
  21. if (i == 0) {
  22. if (replace_existing) {
  23. import_mesh_make_mesh(part);
  24. }
  25. else {
  26. import_mesh_add_mesh(part);
  27. }
  28. }
  29. else {
  30. import_mesh_add_mesh(part);
  31. }
  32. }
  33. }
  34. else {
  35. let parts: raw_mesh_t[] = [];
  36. let part: raw_mesh_t = obj_parse(b, split_code, 0, false);
  37. array_push(parts, part);
  38. while (part.has_next) {
  39. part = obj_parse(b, split_code, part.pos, false);
  40. // This part does not contain faces (may contain lines only)
  41. if (part.inda.length == 0) {
  42. continue;
  43. }
  44. array_push(parts, part);
  45. }
  46. if (context_raw.split_by == split_type_t.MATERIAL) {
  47. let posa0: i16_array_t;
  48. let posa1: i16_array_t;
  49. let nora0: i16_array_t;
  50. let nora1: i16_array_t;
  51. let texa0: i16_array_t;
  52. let texa1: i16_array_t;
  53. let inda0: u32_array_t;
  54. let inda1: u32_array_t;
  55. // Merge to single object per material
  56. for (let i: i32 = 0; i < parts.length; ++i) {
  57. let j: i32 = i + 1;
  58. while (j < parts.length) {
  59. let iname: string = parts[i].name;
  60. let jname: string = parts[j].name;
  61. if (iname == jname) {
  62. posa0 = parts[i].posa;
  63. posa1 = parts[j].posa;
  64. nora0 = parts[i].nora;
  65. nora1 = parts[j].nora;
  66. texa0 = parts[i].texa != null ? parts[i].texa : null;
  67. texa1 = parts[j].texa != null ? parts[j].texa : null;
  68. inda0 = parts[i].inda;
  69. inda1 = parts[j].inda;
  70. let voff: i32 = math_floor(posa0.length / 4);
  71. // Repack merged positions
  72. let posa32: f32_array_t = f32_array_create(math_floor(posa0.length / 4) * 3 + math_floor(posa1.length / 4) * 3);
  73. for (let k: i32 = 0; k < math_floor(posa0.length / 4); ++k) {
  74. posa32[k * 3] = posa0[k * 4] / 32767 * parts[i].scale_pos;
  75. posa32[k * 3 + 1] = posa0[k * 4 + 1] / 32767 * parts[i].scale_pos;
  76. posa32[k * 3 + 2] = posa0[k * 4 + 2] / 32767 * parts[i].scale_pos;
  77. }
  78. for (let k: i32 = 0; k < math_floor(posa1.length / 4); ++k) {
  79. posa32[voff * 3 + k * 3] = posa1[k * 4] / 32767 * parts[j].scale_pos;
  80. posa32[voff * 3 + k * 3 + 1] = posa1[k * 4 + 1] / 32767 * parts[j].scale_pos;
  81. posa32[voff * 3 + k * 3 + 2] = posa1[k * 4 + 2] / 32767 * parts[j].scale_pos;
  82. }
  83. let scale_pos: f32 = 0.0;
  84. for (let k: i32 = 0; k < posa32.length; ++k) {
  85. let f: f32 = math_abs(posa32[k]);
  86. if (scale_pos < f) {
  87. scale_pos = f;
  88. }
  89. }
  90. let inv: f32 = 32767 * (1 / scale_pos);
  91. let posa: i16_array_t = i16_array_create(posa0.length + posa1.length);
  92. for (let k: i32 = 0; k < math_floor(posa.length / 4); ++k) {
  93. posa[k * 4] = math_floor(posa32[k * 3] * inv);
  94. posa[k * 4 + 1] = math_floor(posa32[k * 3 + 1] * inv);
  95. posa[k * 4 + 2] = math_floor(posa32[k * 3 + 2] * inv);
  96. }
  97. for (let k: i32 = 0; k < math_floor(posa0.length / 4); ++k) {
  98. posa[k * 4 + 3] = posa0[k * 4 + 3];
  99. }
  100. for (let k: i32 = 0; k < math_floor(posa1.length / 4); ++k) {
  101. posa[posa0.length + k * 4 + 3] = posa1[k * 4 + 3];
  102. }
  103. // Merge normals and uvs
  104. let nora: i16_array_t = i16_array_create(nora0.length + nora1.length);
  105. let texa: i16_array_t = (texa0 != null && texa1 != null) ? i16_array_create(texa0.length + texa1.length) : null;
  106. let inda: u32_array_t = u32_array_create(inda0.length + inda1.length);
  107. for (let k: i32 = 0; k < nora0.length; ++k) {
  108. nora[k] = nora0[k];
  109. }
  110. for (let k: i32 = 0; k < nora1.length; ++k) {
  111. nora[k + nora0.length] = nora1[k];
  112. }
  113. if (texa != null) {
  114. for (let k: i32 = 0; k < texa0.length; ++k) {
  115. texa[k] = texa0[k];
  116. }
  117. for (let k: i32 = 0; k < texa1.length; ++k) {
  118. texa[k + texa0.length] = texa1[k];
  119. }
  120. }
  121. for (let k: i32 = 0; k < inda0.length; ++k) {
  122. inda[k] = inda0[k];
  123. }
  124. for (let k: i32 = 0; k < inda1.length; ++k) {
  125. inda[k + inda0.length] = inda1[k] + voff;
  126. }
  127. parts[i].posa = posa;
  128. parts[i].nora = nora;
  129. parts[i].texa = texa;
  130. parts[i].inda = inda;
  131. parts[i].scale_pos = scale_pos;
  132. array_splice(parts, j, 1);
  133. }
  134. else {
  135. j++;
  136. }
  137. }
  138. }
  139. }
  140. replace_existing ? import_mesh_make_mesh(parts[0]) : import_mesh_add_mesh(parts[0]);
  141. for (let i: i32 = 1; i < parts.length; ++i) {
  142. import_mesh_add_mesh(parts[i]);
  143. }
  144. }
  145. data_delete_blob(path);
  146. }