surface_tool.cpp 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107
  1. /*************************************************************************/
  2. /* surface_tool.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2020 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2020 Godot Engine contributors (cf. AUTHORS.md). */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /*************************************************************************/
  30. #include "surface_tool.h"
  31. #include "core/method_bind_ext.gen.inc"
  32. #define _VERTEX_SNAP 0.0001
  33. #define EQ_VERTEX_DIST 0.00001
  34. bool SurfaceTool::Vertex::operator==(const Vertex &p_vertex) const {
  35. if (vertex != p_vertex.vertex)
  36. return false;
  37. if (uv != p_vertex.uv)
  38. return false;
  39. if (uv2 != p_vertex.uv2)
  40. return false;
  41. if (normal != p_vertex.normal)
  42. return false;
  43. if (binormal != p_vertex.binormal)
  44. return false;
  45. if (color != p_vertex.color)
  46. return false;
  47. if (bones.size() != p_vertex.bones.size())
  48. return false;
  49. for (int i = 0; i < bones.size(); i++) {
  50. if (bones[i] != p_vertex.bones[i])
  51. return false;
  52. }
  53. for (int i = 0; i < weights.size(); i++) {
  54. if (weights[i] != p_vertex.weights[i])
  55. return false;
  56. }
  57. return true;
  58. }
  59. uint32_t SurfaceTool::VertexHasher::hash(const Vertex &p_vtx) {
  60. uint32_t h = hash_djb2_buffer((const uint8_t *)&p_vtx.vertex, sizeof(real_t) * 3);
  61. h = hash_djb2_buffer((const uint8_t *)&p_vtx.normal, sizeof(real_t) * 3, h);
  62. h = hash_djb2_buffer((const uint8_t *)&p_vtx.binormal, sizeof(real_t) * 3, h);
  63. h = hash_djb2_buffer((const uint8_t *)&p_vtx.tangent, sizeof(real_t) * 3, h);
  64. h = hash_djb2_buffer((const uint8_t *)&p_vtx.uv, sizeof(real_t) * 2, h);
  65. h = hash_djb2_buffer((const uint8_t *)&p_vtx.uv2, sizeof(real_t) * 2, h);
  66. h = hash_djb2_buffer((const uint8_t *)&p_vtx.color, sizeof(real_t) * 4, h);
  67. h = hash_djb2_buffer((const uint8_t *)p_vtx.bones.ptr(), p_vtx.bones.size() * sizeof(int), h);
  68. h = hash_djb2_buffer((const uint8_t *)p_vtx.weights.ptr(), p_vtx.weights.size() * sizeof(float), h);
  69. return h;
  70. }
  71. void SurfaceTool::begin(Mesh::PrimitiveType p_primitive) {
  72. clear();
  73. primitive = p_primitive;
  74. begun = true;
  75. first = true;
  76. }
  77. void SurfaceTool::add_vertex(const Vector3 &p_vertex) {
  78. ERR_FAIL_COND(!begun);
  79. Vertex vtx;
  80. vtx.vertex = p_vertex;
  81. vtx.color = last_color;
  82. vtx.normal = last_normal;
  83. vtx.uv = last_uv;
  84. vtx.uv2 = last_uv2;
  85. vtx.weights = last_weights;
  86. vtx.bones = last_bones;
  87. vtx.tangent = last_tangent.normal;
  88. vtx.binormal = last_normal.cross(last_tangent.normal).normalized() * last_tangent.d;
  89. const int expected_vertices = 4;
  90. if ((format & Mesh::ARRAY_FORMAT_WEIGHTS || format & Mesh::ARRAY_FORMAT_BONES) && (vtx.weights.size() != expected_vertices || vtx.bones.size() != expected_vertices)) {
  91. //ensure vertices are the expected amount
  92. ERR_FAIL_COND(vtx.weights.size() != vtx.bones.size());
  93. if (vtx.weights.size() < expected_vertices) {
  94. //less than required, fill
  95. for (int i = vtx.weights.size(); i < expected_vertices; i++) {
  96. vtx.weights.push_back(0);
  97. vtx.bones.push_back(0);
  98. }
  99. } else if (vtx.weights.size() > expected_vertices) {
  100. //more than required, sort, cap and normalize.
  101. Vector<WeightSort> weights;
  102. for (int i = 0; i < vtx.weights.size(); i++) {
  103. WeightSort ws;
  104. ws.index = vtx.bones[i];
  105. ws.weight = vtx.weights[i];
  106. weights.push_back(ws);
  107. }
  108. //sort
  109. weights.sort();
  110. //cap
  111. weights.resize(expected_vertices);
  112. //renormalize
  113. float total = 0;
  114. for (int i = 0; i < expected_vertices; i++) {
  115. total += weights[i].weight;
  116. }
  117. vtx.weights.resize(expected_vertices);
  118. vtx.bones.resize(expected_vertices);
  119. for (int i = 0; i < expected_vertices; i++) {
  120. if (total > 0) {
  121. vtx.weights.write[i] = weights[i].weight / total;
  122. } else {
  123. vtx.weights.write[i] = 0;
  124. }
  125. vtx.bones.write[i] = weights[i].index;
  126. }
  127. }
  128. }
  129. vertex_array.push_back(vtx);
  130. first = false;
  131. format |= Mesh::ARRAY_FORMAT_VERTEX;
  132. }
  133. void SurfaceTool::add_color(Color p_color) {
  134. ERR_FAIL_COND(!begun);
  135. ERR_FAIL_COND(!first && !(format & Mesh::ARRAY_FORMAT_COLOR));
  136. format |= Mesh::ARRAY_FORMAT_COLOR;
  137. last_color = p_color;
  138. }
  139. void SurfaceTool::add_normal(const Vector3 &p_normal) {
  140. ERR_FAIL_COND(!begun);
  141. ERR_FAIL_COND(!first && !(format & Mesh::ARRAY_FORMAT_NORMAL));
  142. format |= Mesh::ARRAY_FORMAT_NORMAL;
  143. last_normal = p_normal;
  144. }
  145. void SurfaceTool::add_tangent(const Plane &p_tangent) {
  146. ERR_FAIL_COND(!begun);
  147. ERR_FAIL_COND(!first && !(format & Mesh::ARRAY_FORMAT_TANGENT));
  148. format |= Mesh::ARRAY_FORMAT_TANGENT;
  149. last_tangent = p_tangent;
  150. }
  151. void SurfaceTool::add_uv(const Vector2 &p_uv) {
  152. ERR_FAIL_COND(!begun);
  153. ERR_FAIL_COND(!first && !(format & Mesh::ARRAY_FORMAT_TEX_UV));
  154. format |= Mesh::ARRAY_FORMAT_TEX_UV;
  155. last_uv = p_uv;
  156. }
  157. void SurfaceTool::add_uv2(const Vector2 &p_uv2) {
  158. ERR_FAIL_COND(!begun);
  159. ERR_FAIL_COND(!first && !(format & Mesh::ARRAY_FORMAT_TEX_UV2));
  160. format |= Mesh::ARRAY_FORMAT_TEX_UV2;
  161. last_uv2 = p_uv2;
  162. }
  163. void SurfaceTool::add_bones(const Vector<int> &p_bones) {
  164. ERR_FAIL_COND(!begun);
  165. ERR_FAIL_COND(!first && !(format & Mesh::ARRAY_FORMAT_BONES));
  166. format |= Mesh::ARRAY_FORMAT_BONES;
  167. last_bones = p_bones;
  168. }
  169. void SurfaceTool::add_weights(const Vector<float> &p_weights) {
  170. ERR_FAIL_COND(!begun);
  171. ERR_FAIL_COND(!first && !(format & Mesh::ARRAY_FORMAT_WEIGHTS));
  172. format |= Mesh::ARRAY_FORMAT_WEIGHTS;
  173. last_weights = p_weights;
  174. }
  175. void SurfaceTool::add_smooth_group(bool p_smooth) {
  176. ERR_FAIL_COND(!begun);
  177. if (index_array.size()) {
  178. smooth_groups[index_array.size()] = p_smooth;
  179. } else {
  180. smooth_groups[vertex_array.size()] = p_smooth;
  181. }
  182. }
  183. void SurfaceTool::add_triangle_fan(const Vector<Vector3> &p_vertices, const Vector<Vector2> &p_uvs, const Vector<Color> &p_colors, const Vector<Vector2> &p_uv2s, const Vector<Vector3> &p_normals, const Vector<Plane> &p_tangents) {
  184. ERR_FAIL_COND(!begun);
  185. ERR_FAIL_COND(primitive != Mesh::PRIMITIVE_TRIANGLES);
  186. ERR_FAIL_COND(p_vertices.size() < 3);
  187. #define ADD_POINT(n) \
  188. { \
  189. if (p_colors.size() > n) \
  190. add_color(p_colors[n]); \
  191. if (p_uvs.size() > n) \
  192. add_uv(p_uvs[n]); \
  193. if (p_uv2s.size() > n) \
  194. add_uv2(p_uv2s[n]); \
  195. if (p_normals.size() > n) \
  196. add_normal(p_normals[n]); \
  197. if (p_tangents.size() > n) \
  198. add_tangent(p_tangents[n]); \
  199. add_vertex(p_vertices[n]); \
  200. }
  201. for (int i = 0; i < p_vertices.size() - 2; i++) {
  202. ADD_POINT(0);
  203. ADD_POINT(i + 1);
  204. ADD_POINT(i + 2);
  205. }
  206. #undef ADD_POINT
  207. }
  208. void SurfaceTool::add_index(int p_index) {
  209. ERR_FAIL_COND(!begun);
  210. format |= Mesh::ARRAY_FORMAT_INDEX;
  211. index_array.push_back(p_index);
  212. }
  213. Array SurfaceTool::commit_to_arrays() {
  214. int varr_len = vertex_array.size();
  215. Array a;
  216. a.resize(Mesh::ARRAY_MAX);
  217. for (int i = 0; i < Mesh::ARRAY_MAX; i++) {
  218. if (!(format & (1 << i)))
  219. continue; //not in format
  220. switch (i) {
  221. case Mesh::ARRAY_VERTEX:
  222. case Mesh::ARRAY_NORMAL: {
  223. PoolVector<Vector3> array;
  224. array.resize(varr_len);
  225. PoolVector<Vector3>::Write w = array.write();
  226. int idx = 0;
  227. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next(), idx++) {
  228. const Vertex &v = E->get();
  229. switch (i) {
  230. case Mesh::ARRAY_VERTEX: {
  231. w[idx] = v.vertex;
  232. } break;
  233. case Mesh::ARRAY_NORMAL: {
  234. w[idx] = v.normal;
  235. } break;
  236. }
  237. }
  238. w.release();
  239. a[i] = array;
  240. } break;
  241. case Mesh::ARRAY_TEX_UV:
  242. case Mesh::ARRAY_TEX_UV2: {
  243. PoolVector<Vector2> array;
  244. array.resize(varr_len);
  245. PoolVector<Vector2>::Write w = array.write();
  246. int idx = 0;
  247. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next(), idx++) {
  248. const Vertex &v = E->get();
  249. switch (i) {
  250. case Mesh::ARRAY_TEX_UV: {
  251. w[idx] = v.uv;
  252. } break;
  253. case Mesh::ARRAY_TEX_UV2: {
  254. w[idx] = v.uv2;
  255. } break;
  256. }
  257. }
  258. w.release();
  259. a[i] = array;
  260. } break;
  261. case Mesh::ARRAY_TANGENT: {
  262. PoolVector<float> array;
  263. array.resize(varr_len * 4);
  264. PoolVector<float>::Write w = array.write();
  265. int idx = 0;
  266. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next(), idx += 4) {
  267. const Vertex &v = E->get();
  268. w[idx + 0] = v.tangent.x;
  269. w[idx + 1] = v.tangent.y;
  270. w[idx + 2] = v.tangent.z;
  271. //float d = v.tangent.dot(v.binormal,v.normal);
  272. float d = v.binormal.dot(v.normal.cross(v.tangent));
  273. w[idx + 3] = d < 0 ? -1 : 1;
  274. }
  275. w.release();
  276. a[i] = array;
  277. } break;
  278. case Mesh::ARRAY_COLOR: {
  279. PoolVector<Color> array;
  280. array.resize(varr_len);
  281. PoolVector<Color>::Write w = array.write();
  282. int idx = 0;
  283. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next(), idx++) {
  284. const Vertex &v = E->get();
  285. w[idx] = v.color;
  286. }
  287. w.release();
  288. a[i] = array;
  289. } break;
  290. case Mesh::ARRAY_BONES: {
  291. PoolVector<int> array;
  292. array.resize(varr_len * 4);
  293. PoolVector<int>::Write w = array.write();
  294. int idx = 0;
  295. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next(), idx += 4) {
  296. const Vertex &v = E->get();
  297. ERR_CONTINUE(v.bones.size() != 4);
  298. for (int j = 0; j < 4; j++) {
  299. w[idx + j] = v.bones[j];
  300. }
  301. }
  302. w.release();
  303. a[i] = array;
  304. } break;
  305. case Mesh::ARRAY_WEIGHTS: {
  306. PoolVector<float> array;
  307. array.resize(varr_len * 4);
  308. PoolVector<float>::Write w = array.write();
  309. int idx = 0;
  310. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next(), idx += 4) {
  311. const Vertex &v = E->get();
  312. ERR_CONTINUE(v.weights.size() != 4);
  313. for (int j = 0; j < 4; j++) {
  314. w[idx + j] = v.weights[j];
  315. }
  316. }
  317. w.release();
  318. a[i] = array;
  319. } break;
  320. case Mesh::ARRAY_INDEX: {
  321. ERR_CONTINUE(index_array.size() == 0);
  322. PoolVector<int> array;
  323. array.resize(index_array.size());
  324. PoolVector<int>::Write w = array.write();
  325. int idx = 0;
  326. for (List<int>::Element *E = index_array.front(); E; E = E->next(), idx++) {
  327. w[idx] = E->get();
  328. }
  329. w.release();
  330. a[i] = array;
  331. } break;
  332. default: {
  333. }
  334. }
  335. }
  336. return a;
  337. }
  338. Ref<ArrayMesh> SurfaceTool::commit(const Ref<ArrayMesh> &p_existing, uint32_t p_flags) {
  339. Ref<ArrayMesh> mesh;
  340. if (p_existing.is_valid())
  341. mesh = p_existing;
  342. else
  343. mesh.instance();
  344. int varr_len = vertex_array.size();
  345. if (varr_len == 0)
  346. return mesh;
  347. int surface = mesh->get_surface_count();
  348. Array a = commit_to_arrays();
  349. mesh->add_surface_from_arrays(primitive, a, Array(), p_flags);
  350. if (material.is_valid())
  351. mesh->surface_set_material(surface, material);
  352. return mesh;
  353. }
  354. void SurfaceTool::index() {
  355. if (index_array.size())
  356. return; //already indexed
  357. HashMap<Vertex, int, VertexHasher> indices;
  358. List<Vertex> new_vertices;
  359. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next()) {
  360. int *idxptr = indices.getptr(E->get());
  361. int idx;
  362. if (!idxptr) {
  363. idx = indices.size();
  364. new_vertices.push_back(E->get());
  365. indices[E->get()] = idx;
  366. } else {
  367. idx = *idxptr;
  368. }
  369. index_array.push_back(idx);
  370. }
  371. vertex_array.clear();
  372. vertex_array = new_vertices;
  373. format |= Mesh::ARRAY_FORMAT_INDEX;
  374. }
  375. void SurfaceTool::deindex() {
  376. if (index_array.size() == 0)
  377. return; //nothing to deindex
  378. Vector<Vertex> varr;
  379. varr.resize(vertex_array.size());
  380. int idx = 0;
  381. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next()) {
  382. varr.write[idx++] = E->get();
  383. }
  384. vertex_array.clear();
  385. for (List<int>::Element *E = index_array.front(); E; E = E->next()) {
  386. ERR_FAIL_INDEX(E->get(), varr.size());
  387. vertex_array.push_back(varr[E->get()]);
  388. }
  389. format &= ~Mesh::ARRAY_FORMAT_INDEX;
  390. index_array.clear();
  391. }
  392. void SurfaceTool::_create_list(const Ref<Mesh> &p_existing, int p_surface, List<Vertex> *r_vertex, List<int> *r_index, int &lformat) {
  393. Array arr = p_existing->surface_get_arrays(p_surface);
  394. ERR_FAIL_COND(arr.size() != VS::ARRAY_MAX);
  395. _create_list_from_arrays(arr, r_vertex, r_index, lformat);
  396. }
  397. Vector<SurfaceTool::Vertex> SurfaceTool::create_vertex_array_from_triangle_arrays(const Array &p_arrays) {
  398. Vector<SurfaceTool::Vertex> ret;
  399. PoolVector<Vector3> varr = p_arrays[VS::ARRAY_VERTEX];
  400. PoolVector<Vector3> narr = p_arrays[VS::ARRAY_NORMAL];
  401. PoolVector<float> tarr = p_arrays[VS::ARRAY_TANGENT];
  402. PoolVector<Color> carr = p_arrays[VS::ARRAY_COLOR];
  403. PoolVector<Vector2> uvarr = p_arrays[VS::ARRAY_TEX_UV];
  404. PoolVector<Vector2> uv2arr = p_arrays[VS::ARRAY_TEX_UV2];
  405. PoolVector<int> barr = p_arrays[VS::ARRAY_BONES];
  406. PoolVector<float> warr = p_arrays[VS::ARRAY_WEIGHTS];
  407. int vc = varr.size();
  408. if (vc == 0)
  409. return ret;
  410. int lformat = 0;
  411. PoolVector<Vector3>::Read rv;
  412. if (varr.size()) {
  413. lformat |= VS::ARRAY_FORMAT_VERTEX;
  414. rv = varr.read();
  415. }
  416. PoolVector<Vector3>::Read rn;
  417. if (narr.size()) {
  418. lformat |= VS::ARRAY_FORMAT_NORMAL;
  419. rn = narr.read();
  420. }
  421. PoolVector<float>::Read rt;
  422. if (tarr.size()) {
  423. lformat |= VS::ARRAY_FORMAT_TANGENT;
  424. rt = tarr.read();
  425. }
  426. PoolVector<Color>::Read rc;
  427. if (carr.size()) {
  428. lformat |= VS::ARRAY_FORMAT_COLOR;
  429. rc = carr.read();
  430. }
  431. PoolVector<Vector2>::Read ruv;
  432. if (uvarr.size()) {
  433. lformat |= VS::ARRAY_FORMAT_TEX_UV;
  434. ruv = uvarr.read();
  435. }
  436. PoolVector<Vector2>::Read ruv2;
  437. if (uv2arr.size()) {
  438. lformat |= VS::ARRAY_FORMAT_TEX_UV2;
  439. ruv2 = uv2arr.read();
  440. }
  441. PoolVector<int>::Read rb;
  442. if (barr.size()) {
  443. lformat |= VS::ARRAY_FORMAT_BONES;
  444. rb = barr.read();
  445. }
  446. PoolVector<float>::Read rw;
  447. if (warr.size()) {
  448. lformat |= VS::ARRAY_FORMAT_WEIGHTS;
  449. rw = warr.read();
  450. }
  451. for (int i = 0; i < vc; i++) {
  452. Vertex v;
  453. if (lformat & VS::ARRAY_FORMAT_VERTEX)
  454. v.vertex = varr[i];
  455. if (lformat & VS::ARRAY_FORMAT_NORMAL)
  456. v.normal = narr[i];
  457. if (lformat & VS::ARRAY_FORMAT_TANGENT) {
  458. Plane p(tarr[i * 4 + 0], tarr[i * 4 + 1], tarr[i * 4 + 2], tarr[i * 4 + 3]);
  459. v.tangent = p.normal;
  460. v.binormal = p.normal.cross(v.tangent).normalized() * p.d;
  461. }
  462. if (lformat & VS::ARRAY_FORMAT_COLOR)
  463. v.color = carr[i];
  464. if (lformat & VS::ARRAY_FORMAT_TEX_UV)
  465. v.uv = uvarr[i];
  466. if (lformat & VS::ARRAY_FORMAT_TEX_UV2)
  467. v.uv2 = uv2arr[i];
  468. if (lformat & VS::ARRAY_FORMAT_BONES) {
  469. Vector<int> b;
  470. b.resize(4);
  471. b.write[0] = barr[i * 4 + 0];
  472. b.write[1] = barr[i * 4 + 1];
  473. b.write[2] = barr[i * 4 + 2];
  474. b.write[3] = barr[i * 4 + 3];
  475. v.bones = b;
  476. }
  477. if (lformat & VS::ARRAY_FORMAT_WEIGHTS) {
  478. Vector<float> w;
  479. w.resize(4);
  480. w.write[0] = warr[i * 4 + 0];
  481. w.write[1] = warr[i * 4 + 1];
  482. w.write[2] = warr[i * 4 + 2];
  483. w.write[3] = warr[i * 4 + 3];
  484. v.weights = w;
  485. }
  486. ret.push_back(v);
  487. }
  488. return ret;
  489. }
  490. void SurfaceTool::_create_list_from_arrays(Array arr, List<Vertex> *r_vertex, List<int> *r_index, int &lformat) {
  491. PoolVector<Vector3> varr = arr[VS::ARRAY_VERTEX];
  492. PoolVector<Vector3> narr = arr[VS::ARRAY_NORMAL];
  493. PoolVector<float> tarr = arr[VS::ARRAY_TANGENT];
  494. PoolVector<Color> carr = arr[VS::ARRAY_COLOR];
  495. PoolVector<Vector2> uvarr = arr[VS::ARRAY_TEX_UV];
  496. PoolVector<Vector2> uv2arr = arr[VS::ARRAY_TEX_UV2];
  497. PoolVector<int> barr = arr[VS::ARRAY_BONES];
  498. PoolVector<float> warr = arr[VS::ARRAY_WEIGHTS];
  499. int vc = varr.size();
  500. if (vc == 0)
  501. return;
  502. lformat = 0;
  503. PoolVector<Vector3>::Read rv;
  504. if (varr.size()) {
  505. lformat |= VS::ARRAY_FORMAT_VERTEX;
  506. rv = varr.read();
  507. }
  508. PoolVector<Vector3>::Read rn;
  509. if (narr.size()) {
  510. lformat |= VS::ARRAY_FORMAT_NORMAL;
  511. rn = narr.read();
  512. }
  513. PoolVector<float>::Read rt;
  514. if (tarr.size()) {
  515. lformat |= VS::ARRAY_FORMAT_TANGENT;
  516. rt = tarr.read();
  517. }
  518. PoolVector<Color>::Read rc;
  519. if (carr.size()) {
  520. lformat |= VS::ARRAY_FORMAT_COLOR;
  521. rc = carr.read();
  522. }
  523. PoolVector<Vector2>::Read ruv;
  524. if (uvarr.size()) {
  525. lformat |= VS::ARRAY_FORMAT_TEX_UV;
  526. ruv = uvarr.read();
  527. }
  528. PoolVector<Vector2>::Read ruv2;
  529. if (uv2arr.size()) {
  530. lformat |= VS::ARRAY_FORMAT_TEX_UV2;
  531. ruv2 = uv2arr.read();
  532. }
  533. PoolVector<int>::Read rb;
  534. if (barr.size()) {
  535. lformat |= VS::ARRAY_FORMAT_BONES;
  536. rb = barr.read();
  537. }
  538. PoolVector<float>::Read rw;
  539. if (warr.size()) {
  540. lformat |= VS::ARRAY_FORMAT_WEIGHTS;
  541. rw = warr.read();
  542. }
  543. for (int i = 0; i < vc; i++) {
  544. Vertex v;
  545. if (lformat & VS::ARRAY_FORMAT_VERTEX)
  546. v.vertex = varr[i];
  547. if (lformat & VS::ARRAY_FORMAT_NORMAL)
  548. v.normal = narr[i];
  549. if (lformat & VS::ARRAY_FORMAT_TANGENT) {
  550. Plane p(tarr[i * 4 + 0], tarr[i * 4 + 1], tarr[i * 4 + 2], tarr[i * 4 + 3]);
  551. v.tangent = p.normal;
  552. v.binormal = p.normal.cross(v.tangent).normalized() * p.d;
  553. }
  554. if (lformat & VS::ARRAY_FORMAT_COLOR)
  555. v.color = carr[i];
  556. if (lformat & VS::ARRAY_FORMAT_TEX_UV)
  557. v.uv = uvarr[i];
  558. if (lformat & VS::ARRAY_FORMAT_TEX_UV2)
  559. v.uv2 = uv2arr[i];
  560. if (lformat & VS::ARRAY_FORMAT_BONES) {
  561. Vector<int> b;
  562. b.resize(4);
  563. b.write[0] = barr[i * 4 + 0];
  564. b.write[1] = barr[i * 4 + 1];
  565. b.write[2] = barr[i * 4 + 2];
  566. b.write[3] = barr[i * 4 + 3];
  567. v.bones = b;
  568. }
  569. if (lformat & VS::ARRAY_FORMAT_WEIGHTS) {
  570. Vector<float> w;
  571. w.resize(4);
  572. w.write[0] = warr[i * 4 + 0];
  573. w.write[1] = warr[i * 4 + 1];
  574. w.write[2] = warr[i * 4 + 2];
  575. w.write[3] = warr[i * 4 + 3];
  576. v.weights = w;
  577. }
  578. r_vertex->push_back(v);
  579. }
  580. //indices
  581. PoolVector<int> idx = arr[VS::ARRAY_INDEX];
  582. int is = idx.size();
  583. if (is) {
  584. lformat |= VS::ARRAY_FORMAT_INDEX;
  585. PoolVector<int>::Read iarr = idx.read();
  586. for (int i = 0; i < is; i++) {
  587. r_index->push_back(iarr[i]);
  588. }
  589. }
  590. }
  591. void SurfaceTool::create_from_triangle_arrays(const Array &p_arrays) {
  592. clear();
  593. primitive = Mesh::PRIMITIVE_TRIANGLES;
  594. _create_list_from_arrays(p_arrays, &vertex_array, &index_array, format);
  595. }
  596. void SurfaceTool::create_from(const Ref<Mesh> &p_existing, int p_surface) {
  597. clear();
  598. primitive = p_existing->surface_get_primitive_type(p_surface);
  599. _create_list(p_existing, p_surface, &vertex_array, &index_array, format);
  600. material = p_existing->surface_get_material(p_surface);
  601. }
  602. void SurfaceTool::create_from_blend_shape(const Ref<Mesh> &p_existing, int p_surface, const String &p_blend_shape_name) {
  603. clear();
  604. primitive = p_existing->surface_get_primitive_type(p_surface);
  605. Array arr = p_existing->surface_get_blend_shape_arrays(p_surface);
  606. Array blend_shape_names;
  607. int32_t shape_idx = -1;
  608. for (int32_t i = 0; i < p_existing->get_blend_shape_count(); i++) {
  609. String name = p_existing->get_blend_shape_name(i);
  610. if (name == p_blend_shape_name) {
  611. shape_idx = i;
  612. break;
  613. }
  614. }
  615. ERR_FAIL_COND(shape_idx == -1);
  616. ERR_FAIL_COND(shape_idx >= arr.size());
  617. Array mesh = arr[shape_idx];
  618. ERR_FAIL_COND(mesh.size() != VS::ARRAY_MAX);
  619. _create_list_from_arrays(arr[shape_idx], &vertex_array, &index_array, format);
  620. }
  621. void SurfaceTool::append_from(const Ref<Mesh> &p_existing, int p_surface, const Transform &p_xform) {
  622. if (vertex_array.size() == 0) {
  623. primitive = p_existing->surface_get_primitive_type(p_surface);
  624. format = 0;
  625. }
  626. int nformat;
  627. List<Vertex> nvertices;
  628. List<int> nindices;
  629. _create_list(p_existing, p_surface, &nvertices, &nindices, nformat);
  630. format |= nformat;
  631. int vfrom = vertex_array.size();
  632. for (List<Vertex>::Element *E = nvertices.front(); E; E = E->next()) {
  633. Vertex v = E->get();
  634. v.vertex = p_xform.xform(v.vertex);
  635. if (nformat & VS::ARRAY_FORMAT_NORMAL) {
  636. v.normal = p_xform.basis.xform(v.normal);
  637. }
  638. if (nformat & VS::ARRAY_FORMAT_TANGENT) {
  639. v.tangent = p_xform.basis.xform(v.tangent);
  640. v.binormal = p_xform.basis.xform(v.binormal);
  641. }
  642. vertex_array.push_back(v);
  643. }
  644. for (List<int>::Element *E = nindices.front(); E; E = E->next()) {
  645. int dst_index = E->get() + vfrom;
  646. index_array.push_back(dst_index);
  647. }
  648. if (index_array.size() % 3) {
  649. WARN_PRINT("SurfaceTool: Index array not a multiple of 3.");
  650. }
  651. }
  652. //mikktspace callbacks
  653. namespace {
  654. struct TangentGenerationContextUserData {
  655. Vector<List<SurfaceTool::Vertex>::Element *> vertices;
  656. Vector<List<int>::Element *> indices;
  657. };
  658. } // namespace
  659. int SurfaceTool::mikktGetNumFaces(const SMikkTSpaceContext *pContext) {
  660. TangentGenerationContextUserData &triangle_data = *reinterpret_cast<TangentGenerationContextUserData *>(pContext->m_pUserData);
  661. if (triangle_data.indices.size() > 0) {
  662. return triangle_data.indices.size() / 3;
  663. } else {
  664. return triangle_data.vertices.size() / 3;
  665. }
  666. }
  667. int SurfaceTool::mikktGetNumVerticesOfFace(const SMikkTSpaceContext *pContext, const int iFace) {
  668. return 3; //always 3
  669. }
  670. void SurfaceTool::mikktGetPosition(const SMikkTSpaceContext *pContext, float fvPosOut[], const int iFace, const int iVert) {
  671. TangentGenerationContextUserData &triangle_data = *reinterpret_cast<TangentGenerationContextUserData *>(pContext->m_pUserData);
  672. Vector3 v;
  673. if (triangle_data.indices.size() > 0) {
  674. int index = triangle_data.indices[iFace * 3 + iVert]->get();
  675. if (index < triangle_data.vertices.size()) {
  676. v = triangle_data.vertices[index]->get().vertex;
  677. }
  678. } else {
  679. v = triangle_data.vertices[iFace * 3 + iVert]->get().vertex;
  680. }
  681. fvPosOut[0] = v.x;
  682. fvPosOut[1] = v.y;
  683. fvPosOut[2] = v.z;
  684. }
  685. void SurfaceTool::mikktGetNormal(const SMikkTSpaceContext *pContext, float fvNormOut[], const int iFace, const int iVert) {
  686. TangentGenerationContextUserData &triangle_data = *reinterpret_cast<TangentGenerationContextUserData *>(pContext->m_pUserData);
  687. Vector3 v;
  688. if (triangle_data.indices.size() > 0) {
  689. int index = triangle_data.indices[iFace * 3 + iVert]->get();
  690. if (index < triangle_data.vertices.size()) {
  691. v = triangle_data.vertices[index]->get().normal;
  692. }
  693. } else {
  694. v = triangle_data.vertices[iFace * 3 + iVert]->get().normal;
  695. }
  696. fvNormOut[0] = v.x;
  697. fvNormOut[1] = v.y;
  698. fvNormOut[2] = v.z;
  699. }
  700. void SurfaceTool::mikktGetTexCoord(const SMikkTSpaceContext *pContext, float fvTexcOut[], const int iFace, const int iVert) {
  701. TangentGenerationContextUserData &triangle_data = *reinterpret_cast<TangentGenerationContextUserData *>(pContext->m_pUserData);
  702. Vector2 v;
  703. if (triangle_data.indices.size() > 0) {
  704. int index = triangle_data.indices[iFace * 3 + iVert]->get();
  705. if (index < triangle_data.vertices.size()) {
  706. v = triangle_data.vertices[index]->get().uv;
  707. }
  708. } else {
  709. v = triangle_data.vertices[iFace * 3 + iVert]->get().uv;
  710. }
  711. fvTexcOut[0] = v.x;
  712. fvTexcOut[1] = v.y;
  713. }
  714. void SurfaceTool::mikktSetTSpaceDefault(const SMikkTSpaceContext *pContext, const float fvTangent[], const float fvBiTangent[], const float fMagS, const float fMagT,
  715. const tbool bIsOrientationPreserving, const int iFace, const int iVert) {
  716. TangentGenerationContextUserData &triangle_data = *reinterpret_cast<TangentGenerationContextUserData *>(pContext->m_pUserData);
  717. Vertex *vtx = NULL;
  718. if (triangle_data.indices.size() > 0) {
  719. int index = triangle_data.indices[iFace * 3 + iVert]->get();
  720. if (index < triangle_data.vertices.size()) {
  721. vtx = &triangle_data.vertices[index]->get();
  722. }
  723. } else {
  724. vtx = &triangle_data.vertices[iFace * 3 + iVert]->get();
  725. }
  726. if (vtx != NULL) {
  727. vtx->tangent = Vector3(fvTangent[0], fvTangent[1], fvTangent[2]);
  728. vtx->binormal = Vector3(-fvBiTangent[0], -fvBiTangent[1], -fvBiTangent[2]); // for some reason these are reversed, something with the coordinate system in Godot
  729. }
  730. }
  731. void SurfaceTool::generate_tangents() {
  732. ERR_FAIL_COND(!(format & Mesh::ARRAY_FORMAT_TEX_UV));
  733. ERR_FAIL_COND(!(format & Mesh::ARRAY_FORMAT_NORMAL));
  734. SMikkTSpaceInterface mkif;
  735. mkif.m_getNormal = mikktGetNormal;
  736. mkif.m_getNumFaces = mikktGetNumFaces;
  737. mkif.m_getNumVerticesOfFace = mikktGetNumVerticesOfFace;
  738. mkif.m_getPosition = mikktGetPosition;
  739. mkif.m_getTexCoord = mikktGetTexCoord;
  740. mkif.m_setTSpace = mikktSetTSpaceDefault;
  741. mkif.m_setTSpaceBasic = NULL;
  742. SMikkTSpaceContext msc;
  743. msc.m_pInterface = &mkif;
  744. TangentGenerationContextUserData triangle_data;
  745. triangle_data.vertices.resize(vertex_array.size());
  746. int idx = 0;
  747. for (List<Vertex>::Element *E = vertex_array.front(); E; E = E->next()) {
  748. triangle_data.vertices.write[idx++] = E;
  749. E->get().binormal = Vector3();
  750. E->get().tangent = Vector3();
  751. }
  752. triangle_data.indices.resize(index_array.size());
  753. idx = 0;
  754. for (List<int>::Element *E = index_array.front(); E; E = E->next()) {
  755. triangle_data.indices.write[idx++] = E;
  756. }
  757. msc.m_pUserData = &triangle_data;
  758. bool res = genTangSpaceDefault(&msc);
  759. ERR_FAIL_COND(!res);
  760. format |= Mesh::ARRAY_FORMAT_TANGENT;
  761. }
  762. void SurfaceTool::generate_normals(bool p_flip) {
  763. ERR_FAIL_COND(primitive != Mesh::PRIMITIVE_TRIANGLES);
  764. bool was_indexed = index_array.size();
  765. deindex();
  766. HashMap<Vertex, Vector3, VertexHasher> vertex_hash;
  767. int count = 0;
  768. bool smooth = false;
  769. if (smooth_groups.has(0))
  770. smooth = smooth_groups[0];
  771. List<Vertex>::Element *B = vertex_array.front();
  772. for (List<Vertex>::Element *E = B; E;) {
  773. List<Vertex>::Element *v[3];
  774. v[0] = E;
  775. v[1] = v[0]->next();
  776. ERR_FAIL_COND(!v[1]);
  777. v[2] = v[1]->next();
  778. ERR_FAIL_COND(!v[2]);
  779. E = v[2]->next();
  780. Vector3 normal;
  781. if (!p_flip)
  782. normal = Plane(v[0]->get().vertex, v[1]->get().vertex, v[2]->get().vertex).normal;
  783. else
  784. normal = Plane(v[2]->get().vertex, v[1]->get().vertex, v[0]->get().vertex).normal;
  785. if (smooth) {
  786. for (int i = 0; i < 3; i++) {
  787. Vector3 *lv = vertex_hash.getptr(v[i]->get());
  788. if (!lv) {
  789. vertex_hash.set(v[i]->get(), normal);
  790. } else {
  791. (*lv) += normal;
  792. }
  793. }
  794. } else {
  795. for (int i = 0; i < 3; i++) {
  796. v[i]->get().normal = normal;
  797. }
  798. }
  799. count += 3;
  800. if (smooth_groups.has(count) || !E) {
  801. if (vertex_hash.size()) {
  802. while (B != E) {
  803. Vector3 *lv = vertex_hash.getptr(B->get());
  804. if (lv) {
  805. B->get().normal = lv->normalized();
  806. }
  807. B = B->next();
  808. }
  809. } else {
  810. B = E;
  811. }
  812. vertex_hash.clear();
  813. if (E) {
  814. smooth = smooth_groups[count];
  815. }
  816. }
  817. }
  818. format |= Mesh::ARRAY_FORMAT_NORMAL;
  819. if (was_indexed) {
  820. index();
  821. smooth_groups.clear();
  822. }
  823. }
  824. void SurfaceTool::set_material(const Ref<Material> &p_material) {
  825. material = p_material;
  826. }
  827. void SurfaceTool::clear() {
  828. begun = false;
  829. primitive = Mesh::PRIMITIVE_LINES;
  830. format = 0;
  831. last_bones.clear();
  832. last_weights.clear();
  833. index_array.clear();
  834. vertex_array.clear();
  835. smooth_groups.clear();
  836. material.unref();
  837. }
  838. void SurfaceTool::_bind_methods() {
  839. ClassDB::bind_method(D_METHOD("begin", "primitive"), &SurfaceTool::begin);
  840. ClassDB::bind_method(D_METHOD("add_vertex", "vertex"), &SurfaceTool::add_vertex);
  841. ClassDB::bind_method(D_METHOD("add_color", "color"), &SurfaceTool::add_color);
  842. ClassDB::bind_method(D_METHOD("add_normal", "normal"), &SurfaceTool::add_normal);
  843. ClassDB::bind_method(D_METHOD("add_tangent", "tangent"), &SurfaceTool::add_tangent);
  844. ClassDB::bind_method(D_METHOD("add_uv", "uv"), &SurfaceTool::add_uv);
  845. ClassDB::bind_method(D_METHOD("add_uv2", "uv2"), &SurfaceTool::add_uv2);
  846. ClassDB::bind_method(D_METHOD("add_bones", "bones"), &SurfaceTool::add_bones);
  847. ClassDB::bind_method(D_METHOD("add_weights", "weights"), &SurfaceTool::add_weights);
  848. ClassDB::bind_method(D_METHOD("add_smooth_group", "smooth"), &SurfaceTool::add_smooth_group);
  849. ClassDB::bind_method(D_METHOD("add_triangle_fan", "vertices", "uvs", "colors", "uv2s", "normals", "tangents"), &SurfaceTool::add_triangle_fan, DEFVAL(Vector<Vector2>()), DEFVAL(Vector<Color>()), DEFVAL(Vector<Vector2>()), DEFVAL(Vector<Vector3>()), DEFVAL(Vector<Plane>()));
  850. ClassDB::bind_method(D_METHOD("add_index", "index"), &SurfaceTool::add_index);
  851. ClassDB::bind_method(D_METHOD("index"), &SurfaceTool::index);
  852. ClassDB::bind_method(D_METHOD("deindex"), &SurfaceTool::deindex);
  853. ClassDB::bind_method(D_METHOD("generate_normals", "flip"), &SurfaceTool::generate_normals, DEFVAL(false));
  854. ClassDB::bind_method(D_METHOD("generate_tangents"), &SurfaceTool::generate_tangents);
  855. ClassDB::bind_method(D_METHOD("set_material", "material"), &SurfaceTool::set_material);
  856. ClassDB::bind_method(D_METHOD("clear"), &SurfaceTool::clear);
  857. ClassDB::bind_method(D_METHOD("create_from", "existing", "surface"), &SurfaceTool::create_from);
  858. ClassDB::bind_method(D_METHOD("create_from_blend_shape", "existing", "surface", "blend_shape"), &SurfaceTool::create_from_blend_shape);
  859. ClassDB::bind_method(D_METHOD("append_from", "existing", "surface", "transform"), &SurfaceTool::append_from);
  860. ClassDB::bind_method(D_METHOD("commit", "existing", "flags"), &SurfaceTool::commit, DEFVAL(Variant()), DEFVAL(Mesh::ARRAY_COMPRESS_DEFAULT));
  861. ClassDB::bind_method(D_METHOD("commit_to_arrays"), &SurfaceTool::commit_to_arrays);
  862. }
  863. SurfaceTool::SurfaceTool() {
  864. first = false;
  865. begun = false;
  866. primitive = Mesh::PRIMITIVE_LINES;
  867. format = 0;
  868. }