*/}}

la_tns_mesh.c 36 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663
  1. /*
  2. * LaGUI: A graphical application framework.
  3. * Copyright (C) 2022-2023 Wu Yiming
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. #include "la_5.h"
  19. #include <math.h>
  20. extern tnsMain *T;
  21. void tnsPrintMeshTopology(tnsMeshObject*mo){
  22. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ printf("%d ",mv->i); } printf("\n");
  23. for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ printf("%d-%d ",me->vl->i,me->vr->i); } printf("\n");
  24. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ printf("%d-[",mf->looplen);
  25. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){ tnsMEdge*ie=lip->p;
  26. printf("%d%s%d ",ie->vl->i,(ie->fl&&ie->fr)?":":(ie->fl?"l":(ie->fr?"r":"-")),ie->vr->i); }
  27. printf("] ");
  28. }printf("\n");
  29. }
  30. tnsEdgeHash* tnsCreateEdgeHash(int OptionalInitialVertCount){
  31. tnsEdgeHash*eh=memAcquireSimple(sizeof(tnsEdgeHash));
  32. eh->max=OptionalInitialVertCount;
  33. if(eh->max<16) eh->max=16;
  34. arrInitLength(&eh->vl,eh->max,&eh->max, sizeof(tnsEdgeHashVert));
  35. return eh;
  36. }
  37. void tnsDestroyEdgeHash(tnsEdgeHash* eh){
  38. for(int i=0;i<eh->max;i++){
  39. tnsEdgeHashVert* ehv=&eh->vl[i];
  40. if(ehv->e) free(ehv->e);
  41. }
  42. if(eh->vl) free(eh->vl);
  43. memFree(eh);
  44. }
  45. void tnsEdgeHashAddVertPair(tnsEdgeHash* eh, int v1, int v2){
  46. if(v1==v2) return; if(v1>v2) LA_SWAP(int, v1,v2); if(v1>=eh->max) return;
  47. tnsEdgeHashVert* ehv=&eh->vl[v1];
  48. if(!ehv->e) arrInitLength(&ehv->e,1,&ehv->max, sizeof(tnsEdgeHashEdge));
  49. else arrEnsureLength(&ehv->e, ehv->next, &ehv->max, sizeof(tnsEdgeHashEdge));
  50. for(int i=0;i<ehv->next;i++){ if(ehv->e[i].tv==v2) return; }
  51. ehv->e[ehv->next].tv=v2;
  52. ehv->next++;
  53. }
  54. tnsEdgeHashEdge* tnsEdgeHashGetEdge(tnsEdgeHash* eh, int v1, int v2){
  55. if(v1==v2) return 0; if(v1>v2) LA_SWAP(int, v1,v2); if(v1>=eh->max) return 0;
  56. tnsEdgeHashVert* ehv=&eh->vl[v1];
  57. for(int i=0;i<ehv->next;i++){ if(ehv->e[i].tv==v2) return &ehv->e[i]; }
  58. return 0;
  59. }
  60. void tnsInitMesh(tnsMeshObject* mo, int Initialv, int Initiale, int Initialf){
  61. arrInitLength(&mo->v, Initialv, &mo->maxv, sizeof(tnsVert));
  62. arrInitLength(&mo->e, Initiale, &mo->maxe, sizeof(tnsEdge));
  63. arrInitLength(&mo->f, Initialf, &mo->maxf, sizeof(tnsFace));
  64. }
  65. tnsVert* tnsFillVertI(tnsMeshObject* mo, int index, real x, real y, real z){
  66. arrEnsureLength(&mo->v, index, &mo->maxv, sizeof(tnsVert));
  67. mo->v[index].p[0]=x;
  68. mo->v[index].p[1]=y;
  69. mo->v[index].p[2]=z;
  70. return &mo->v[index];
  71. }
  72. tnsVert* tnsFillVert(tnsMeshObject* mo, real x, real y, real z){
  73. int index=mo->totv; mo->totv++;
  74. return tnsFillVertI(mo, index, x,y,z);
  75. }
  76. tnsFace* tnsFillFace(tnsMeshObject* mo, int vertcount, ...){
  77. arrEnsureLength(&mo->f, mo->totf, &mo->maxf, sizeof(tnsFace));
  78. arrInitLength(&mo->f[mo->totf].loop, vertcount, &mo->f[mo->totf].looplen, sizeof(int));
  79. va_list list; va_start(list, vertcount); int id=va_arg(list, int); if(id==-1){ va_end(list); mo->totf++; return &mo->f[mo->totf-1]; }
  80. for(int i=0;i<vertcount;i++){ mo->f[mo->totf].loop[i]=id; id=va_arg(list, int); }
  81. va_end(list);
  82. mo->totf++; return &mo->f[mo->totf-1];
  83. }
  84. void tnsFillFaceLoop(tnsFace* f, int i, int v){ f->loop[i]=v; }
  85. void tnsFillFaceNormal(tnsFace* f, real* normal){ tnsVectorSet3v(f->n, normal); }
  86. void tnsFillVertNormal(tnsVert* v, real* normal){ tnsVectorSet3v(v->n, normal); }
  87. int tnsMergeMeshObjects(tnsMeshObject* into, tnsMeshObject* mo){
  88. if(into->Base.Type!=TNS_OBJECT_MESH||mo->Base.Type!=TNS_OBJECT_MESH) return 0;
  89. if(!mo->totv){ tnsDestroyObject(mo); return 1; }
  90. tnsVector3d v,vf; tnsMatrix44d inv; tnsInverse44d(inv, into->Base.GlobalTransform);
  91. for(int i=0;i<mo->totv;i++){
  92. tnsVectorSet3v(v,mo->v[i].p); tnsApplyTransform43d(vf, mo->Base.GlobalTransform, v);
  93. tnsApplyTransform43d(v, inv, vf); tnsVectorSet3v(mo->v[i].p,v);
  94. }
  95. for(int i=0;i<mo->tote;i++){ mo->e[i].l+=into->totv; mo->e[i].r+=into->totv; }
  96. for(int i=0;i<mo->totf;i++){ for(int l=0;l<mo->f[i].looplen;l++){ mo->f[i].loop[l]+=into->totv; } }
  97. int origv=into->totv, orige=into->tote, origf=into->totf;
  98. into->totv+=mo->totv; into->tote+=mo->tote; into->totf+=mo->totf;
  99. arrEnsureLength(&into->v, into->totv, &into->maxv, sizeof(tnsVert)); if(mo->totv) memcpy(&into->v[origv],mo->v,sizeof(tnsVert)*mo->totv);
  100. arrEnsureLength(&into->e, into->tote, &into->maxe, sizeof(tnsEdge)); if(mo->tote) memcpy(&into->e[orige],mo->e,sizeof(tnsEdge)*mo->tote);
  101. arrEnsureLength(&into->f, into->totf, &into->maxf, sizeof(tnsFace)); if(mo->totf){ memcpy(&into->f[origf],mo->f,sizeof(tnsFace)*mo->totf);
  102. for(int i=origf;i<into->totf;i++){ into->f[i].loop=0; arrInitLength(&into->f[i].loop, into->f[i].looplen, &into->f[i].looplen, sizeof(int));
  103. for(int l=0;l<into->f[i].looplen;l++){ into->f[i].loop[l]=mo->f[i-origf].loop[l]; }
  104. }
  105. }
  106. tnsDestroyObject(mo); return 1;
  107. }
  108. tnsMeshObject* tnsDuplicateMeshObjects(tnsMeshObject* from){
  109. if(from->Base.Type!=TNS_OBJECT_MESH) return 0;
  110. tnsMeshObject* to = memAcquireHyper(sizeof(tnsMeshObject));
  111. tnsInitObjectBase(to, from->Base.ParentObject?from->Base.ParentObject:from->Base.InRoot, from->Base.Name->Ptr, TNS_OBJECT_MESH,0,0,0,0,0,0,0,0,1);
  112. tnsCopyObjectTransformationsLocal(to,from);
  113. if(!from->totv){ return to; }
  114. to->totv=from->totv; to->tote=from->tote; to->totf=from->totf;
  115. arrInitLength(&to->v, to->totv, &to->maxv, sizeof(tnsVert)); if(from->totv) memcpy(to->v,from->v,sizeof(tnsVert)*from->totv);
  116. arrInitLength(&to->e, to->tote, &to->maxe, sizeof(tnsEdge)); if(from->tote) memcpy(to->e,from->e,sizeof(tnsEdge)*from->tote);
  117. arrInitLength(&to->f, to->totf, &to->maxf, sizeof(tnsFace)); if(from->totf) memcpy(to->f,from->f,sizeof(tnsFace)*from->totf);
  118. for(int i=0;i<to->totf;i++){ to->f[i].loop=0; arrInitLength(&to->f[i].loop, to->f[i].looplen, &to->f[i].looplen, sizeof(int));
  119. for(int l=0;l<to->f[i].looplen;l++){ to->f[i].loop[l]=from->f[i].loop[l]; }
  120. }
  121. return to;
  122. }
  123. void tnsInitMeshPlane(tnsMeshObject* mo, real size){
  124. tnsInitMesh(mo, 4,0,1);
  125. tnsFillVert(mo, size, size,0); tnsFillVert(mo,-size, size,0);
  126. tnsFillVert(mo,-size,-size,0); tnsFillVert(mo, size,-size,0);
  127. tnsFace* f=tnsFillFace(mo, 4, 0,1,2,3); tnsVector3d n={0,0,1}; tnsFillFaceNormal(f,n);
  128. mo->v[0].flags|=TNS_MESH_FLAG_SELECTED;
  129. mo->v[1].flags|=TNS_MESH_FLAG_SELECTED;
  130. mo->v[2].flags|=TNS_MESH_FLAG_SELECTED;
  131. mo->v[3].flags|=TNS_MESH_FLAG_SELECTED;
  132. tnsMMeshEnsureSelectionFromVerts(mo);
  133. }
  134. void tnsAddMMeshPlane(tnsMeshObject* mo, real size){
  135. tnsMVert *mv1,*mv2,*mv3,*mv4;
  136. mv1=tnsMMeshNewVert(mo); mv1->p[0]=size; mv1->p[1]=size; mv1->flags|=TNS_MESH_FLAG_SELECTED;
  137. mv2=tnsMMeshNewVert(mo); mv2->p[0]=-size; mv2->p[1]=size; mv2->flags|=TNS_MESH_FLAG_SELECTED;
  138. mv3=tnsMMeshNewVert(mo); mv3->p[0]=-size; mv3->p[1]=-size; mv3->flags|=TNS_MESH_FLAG_SELECTED;
  139. mv4=tnsMMeshNewVert(mo); mv4->p[0]=size; mv4->p[1]=-size; mv4->flags|=TNS_MESH_FLAG_SELECTED;
  140. tnsMMeshMakeFace4v(mo,mv1,mv2,mv3,mv4);
  141. }
  142. void tnsTrangulateFaceSimple(tnsMeshObject* mo, int fi, tnsFace* f, int* ebuf){
  143. for(int i=0;i<f->looplen-2;i++){
  144. ebuf[i*3]=f->loop[i];
  145. ebuf[i*3+1]=f->loop[i+1];
  146. ebuf[i*3+2]=fi+mo->totv; //f->loop[i+2];
  147. }
  148. }
  149. void tnsTrangulateFaceSimpleM(tnsMeshObject* mo, int fi, tnsMFace* mf, int* ebuf){
  150. tnsMVert* mv=0,*mvs; int i=0;
  151. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){
  152. laListItemPointer* next=lip->pNext; if(!next) next=mf->l.pFirst; tnsMEdge* me0=lip->p, *me1=next->p;
  153. if(next==mf->l.pLast){ break; }
  154. mvs=tnsMMeshEdgeStartingVert(me0,me1);
  155. if(!mv) mv=mvs;
  156. ebuf[i*3]=mvs->i; tnsMVert*mm=tnsMMeshEdgeAnotherVert(me0,mvs);
  157. ebuf[i*3+1]=mm->i;
  158. ebuf[i*3+2]=fi+mo->totmv; /*tnsMMeshEdgeAnotherVert(me1,mm)->i;*/ i++;
  159. }
  160. }
  161. tnsMVert* tnsGetMFaceLastVert(tnsMFace* mf){
  162. laListItemPointer* lip=mf->l.pLast; laListItemPointer* next=mf->l.pFirst; tnsMEdge* me0=lip->p, *me1=next->p;
  163. return tnsMMeshEdgeStartingVert(me0,me1);
  164. }
  165. int* tnsGetTriangulatedBatch(tnsMeshObject* mo, int* totelem){
  166. int tottri=0;
  167. if(mo->Mode==TNS_MESH_OBJECT_MODE){ for(int i=0;i<mo->totf;i++){ tottri+=(mo->f[i].looplen-2); } }
  168. else{ for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ tottri+=mf->looplen-2; } }
  169. if(!tottri) return 0;
  170. int* ebuf=calloc(1,sizeof(int)*tottri*3); int* pebuf=ebuf;
  171. if(mo->Mode==TNS_MESH_OBJECT_MODE){ for(int i=0;i<mo->totf;i++){ tnsTrangulateFaceSimple(mo, i, &mo->f[i], pebuf); pebuf+=(mo->f[i].looplen-2)*3; } }
  172. else{ int i=0; for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ tnsTrangulateFaceSimpleM(mo, i, mf, pebuf); pebuf+=(mf->looplen-2)*3; i++; } }
  173. *totelem = tottri;
  174. return ebuf;
  175. }
  176. float* tnsGetDrawingVertArray(tnsMeshObject* mo, int* r_tot_render_v, float** r_normals, float** idcolors, float** editcolors, int** edgeelems, int* r_tote){
  177. if(!mo->totv&&!mo->totmv) return 0;
  178. int objmode=mo->Mode==TNS_MESH_OBJECT_MODE;
  179. int totv=objmode?mo->totv:mo->totmv;
  180. int tote=objmode?mo->tote:mo->totme; *r_tote=tote;
  181. int totf=objmode?mo->totf:mo->totmf;
  182. int extraverts=objmode?mo->totf:(mo->totme*2+mo->totmf);
  183. float* p=calloc(1,(totv+extraverts)*3*sizeof(float)); *r_tot_render_v=(totv+extraverts);
  184. float* n=calloc(1,(totv+extraverts)*3*sizeof(float)); *r_normals = n;
  185. if(objmode){
  186. for(int i=0;i<totv;i++){ tnsVectorSet3v(&p[i*3],mo->v[i].p); tnsVectorSet3v(&n[i*3],mo->v[i].n); }
  187. int start=mo->totv*3; for(int i=0;i<totf;i++){
  188. tnsVectorSet3v(&p[start+i*3],mo->v[mo->f[i].loop[mo->f[i].looplen-1]].p); tnsVectorSet3v(&n[start+i*3],mo->f[i].n);
  189. }
  190. }else{
  191. (*idcolors)=calloc(1,(totv+extraverts)*3*sizeof(float));
  192. (*edgeelems)=calloc(1,(extraverts)*2*sizeof(int));
  193. (*editcolors)=calloc(1,totv*4*sizeof(float)*extraverts);
  194. for(tnsMVert*mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ int i=mv->i;
  195. tnsVectorSet3v(&p[i*3],mv->p); tnsVectorSet3v(&n[i*3],mv->n);
  196. int id=i+1; real r=(real)((id & 0x000000FF)>>0)/255.0; real g=(real)((id & 0x0000FF00)>>8)/255.0; real b=(real)((id & 0x00FF0000)>>16)/255.0;
  197. (*idcolors)[i*3]=r; (*idcolors)[i*3+1]=g; (*idcolors)[i*3+2]=b;
  198. real* c=(mv->flags&TNS_MESH_FLAG_SELECTED)?laAccentColor(LA_BT_SVERTEX):laAccentColor(LA_BT_VERTEX);
  199. (*editcolors)[i*4]=c[0]; (*editcolors)[i*4+1]=c[1]; (*editcolors)[i*4+2]=c[2]; (*editcolors)[i*4+3]=c[3];
  200. }
  201. for(tnsMEdge*me=mo->me.pFirst;me;me=me->Item.pNext){ int ei=me->i;
  202. (*edgeelems)[ei*2]=mo->totmv+mo->totmf+ei*2; (*edgeelems)[ei*2+1]=mo->totmv+mo->totmf+ei*2+1;
  203. float* eidcolor1=&(*idcolors)[(*edgeelems)[ei*2]*3], *eidcolor2=&(*idcolors)[(*edgeelems)[ei*2+1]*3];
  204. int id=ei+1; real r=(real)((id & 0x000000FF)>>0)/255.0; real g=(real)((id & 0x0000FF00)>>8)/255.0; real b=(real)((id & 0x00FF0000)>>16)/255.0;
  205. tnsVectorSet3(eidcolor1,r,g,b); tnsVectorSet3(eidcolor2,r,g,b);
  206. int se1=(*edgeelems)[ei*2]; tnsVectorSet3v(&p[se1*3],me->vl->p);
  207. int se2=(*edgeelems)[ei*2+1]; tnsVectorSet3v(&p[se2*3],me->vr->p);
  208. float* eedcolor1=&(*editcolors)[(*edgeelems)[ei*2]*4], *eedcolor2=&(*editcolors)[(*edgeelems)[ei*2+1]*4];
  209. real* c=(me->flags&TNS_MESH_FLAG_SELECTED)?laAccentColor(LA_BT_SEDGE):laAccentColor(LA_BT_EDGE);
  210. tnsVectorSet4v(eedcolor1,c); tnsVectorSet4v(eedcolor2,c);
  211. }
  212. int start=mo->totmv*3; int fi=0; for(tnsMFace*mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){
  213. tnsMVert* sv=tnsGetMFaceLastVert(mf); tnsVectorSet3v(&p[start+fi*3],sv->p); tnsVectorSet3v(&n[start+fi*3],mf->n); fi++;
  214. }
  215. }
  216. return p;
  217. }
  218. int* tnsGetEdgeBatch(tnsMeshObject* mo){
  219. if(!mo->totme) return 0;
  220. int* ebuf=calloc(1,sizeof(int)*mo->totme*2); int* pebuf=ebuf; int i=0;
  221. for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ ebuf[i*2]=me->vl->i; ebuf[i*2+1]=me->vr->i; i++; }
  222. return ebuf;
  223. }
  224. void tnsInvalidateMeshBatch(tnsMeshObject* mo){
  225. if(mo->Base.Type!=TNS_OBJECT_MESH) return;
  226. if(mo->Batch) tnsDeleteBatch(mo->Batch); mo->Batch=0;
  227. }
  228. void tnsRegenerateMeshBatch(tnsMeshObject* mo){
  229. if(!mo) return;
  230. if(mo->Batch) tnsDeleteBatch(mo->Batch); mo->Batch=0;
  231. real meshcolor[4]={0.8,0.8,0.8,1};
  232. int tottri; int* elem = tnsGetTriangulatedBatch(mo, &tottri);
  233. float* idcolors=0,*editcolors=0; int docolors=mo->Mode==TNS_MESH_EDIT_MODE;
  234. int totv,tote; int* eelems=0; float* n=0;
  235. float* v = tnsGetDrawingVertArray(mo,&totv,&n,&idcolors,&editcolors,&eelems,&tote);
  236. if(!v){ if(elem){free(elem);} if(eelems){free(eelems);} return; }
  237. mo->Batch = tnsCreateBatch(totv, 3, v, 3, n, 4, editcolors);
  238. tnsBatchCommand*c=tnsCreateCommand(mo->Batch, "body", tottri, 3, GL_TRIANGLES, elem, 0);
  239. tnsCommandUseUniformColor(c,meshcolor);
  240. free(elem); free(v); free(n);
  241. if(mo->Mode==TNS_MESH_EDIT_MODE){
  242. elem=tnsGetEdgeBatch(mo); if(elem) {
  243. c= tnsCreateCommand(mo->Batch, "lines", mo->totme, 2, GL_LINES, elem, 1); free(elem);
  244. //tnsCommandUseUniformColor(c, laAccentColor(LA_BT_EDGE));
  245. }
  246. c= tnsCreateCommand(mo->Batch, "verts", mo->totmv, 3, GL_POINTS, 0, 1);
  247. c= tnsCreateCommand(mo->Batch, "verts_select", mo->totmv, 3, GL_POINTS, 0, 1);
  248. tnsCommandOverrideColorArray(c, mo->Batch->NumVert, 3, idcolors);
  249. c= tnsCreateCommand(mo->Batch, "edges_select", mo->totme, 2, GL_LINES, eelems, 1);
  250. tnsCommandOverrideColorArray(c, mo->Batch->NumVert, 3, idcolors);
  251. c= tnsCreateCommand(mo->Batch, "edges", mo->totme, 2, GL_LINES, eelems, 1);
  252. tnsCommandOverrideColorArray(c, mo->Batch->NumVert, 4, editcolors);
  253. //for(int i=0;i<mo->totme*2;i++){ printf("%d ",eelems[i]); } printf("\n");
  254. }
  255. if(idcolors) free(idcolors); if(editcolors) free(editcolors); if(eelems) free(eelems);
  256. }
  257. void tnsEnsureMeshBatch(tnsMeshObject* mo){
  258. if(mo->Base.Type!=TNS_OBJECT_MESH) return;
  259. if(mo->Batch) return;
  260. tnsRegenerateMeshBatch(mo);
  261. }
  262. void tnsDrawMeshObject(tnsMeshObject* mo, int DrawAsObjectSelection, int MeshSelectionMode, tnsMeshObject* Active){
  263. tnsEnsureMeshBatch(mo);
  264. if(DrawAsObjectSelection){
  265. if(mo->Base.Flags&TNS_OBJECT_FLAGS_SELECTED && mo->Mode!=TNS_MESH_EDIT_MODE){
  266. real* color=(Active==mo)?laAccentColor(LA_BT_TEXT):laAccentColor(LA_BT_NORMAL);
  267. tnsDrawBatch(mo->Batch, "body", color, 0);
  268. }
  269. }else{
  270. if(T->BindedShader==T->SelectionShader){
  271. int i=mo->Base.SelectID; real color[4]={0,0,0,1}; TNS_ID_TO_COLOR(color,i);
  272. tnsDrawBatch(mo->Batch,"body",color,0);
  273. }else{
  274. tnsUseNormal(1);
  275. tnsDrawBatch(mo->Batch,"body",0,0);
  276. tnsUseNormal(0);
  277. if(mo->Mode==TNS_MESH_EDIT_MODE){
  278. if(MeshSelectionMode==LA_CANVAS_SELECT_MODE_VERTS){
  279. tnsDrawBatch(mo->Batch,"verts",0,0); tnsDrawBatch(mo->Batch,"lines",0,0);
  280. }else{
  281. tnsDrawBatch(mo->Batch,"edges",0,0);
  282. }
  283. }
  284. }
  285. }
  286. }
  287. tnsMFace* tnsMMeshNewFace(tnsMeshObject* mo){ tnsMFace* mf=memAcquireSimple(sizeof(tnsMFace)); mf->i=mo->totmf; mo->totmf++; lstAppendItem(&mo->mf,mf); return mf; }
  288. tnsMEdge* tnsMMeshNewEdge(tnsMeshObject* mo){ tnsMEdge* me=memAcquireSimple(sizeof(tnsMEdge)); me->i=mo->totme; mo->totme++; lstAppendItem(&mo->me,me); return me; }
  289. tnsMVert* tnsMMeshNewVert(tnsMeshObject* mo){ tnsMVert* mv=memAcquireSimple(sizeof(tnsMVert)); mv->i=mo->totmv; mo->totmv++; lstAppendItem(&mo->mv,mv); return mv; }
  290. void tnsMMeshCalculateNormalFrom(tnsMFace* mf){
  291. tnsVector3d accum={0}; tnsVector3d d0,d1; tnsVector3d naccum={0},nn={0};if(mf->flags&TNS_MESH_FLAG_PICKED) return;
  292. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){
  293. laListItemPointer* next=lip->pNext; if(!next) next=mf->l.pFirst; tnsMEdge* me0=lip->p, *me1=next->p;
  294. tnsMVert* v0=tnsMMeshEdgeStartingVert(me0,me1); tnsMVert* v1=tnsMMeshEdgeShareVert(me0,me1); tnsMVert* v2=tnsMMeshEdgeAnotherVert(me1, v1);
  295. tnsVectorAccum3d(accum, v0->p); tnsVectorAccum3d(accum, v1->p); tnsVectorAccum3d(accum, v2->p);
  296. tnsVectorMinus3d(d0,v0->p,v1->p); tnsVectorMinus3d(d1,v2->p,v1->p); real len=tnsVectorCross3d(nn,d0,d1); tnsVectorMultiSelf3d(nn, len);
  297. tnsVectorAccum3d(naccum, nn);
  298. //if(v0==me0->vr){ me0->flags|=TNS_MESH_FLAG_LOOP_REVERSE; } // TODO: consistency not implemented.
  299. }
  300. tnsNormalize3d(mf->n, naccum); tnsVectorMulti3d(mf->c, accum, 1.0/(mf->looplen+2));
  301. mf->flags|=TNS_MESH_FLAG_PICKED;
  302. if(mf->flags&TNS_MESH_FLAG_SELECTED){
  303. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){
  304. tnsMEdge* me=lip->p; tnsMFace* of=((mf==me->fl)?me->fr:me->fl);
  305. if(of) tnsMMeshCalculateNormalFrom(of);
  306. }
  307. }
  308. }
  309. void tnsMMeshCalculateFaceVertNormal(tnsMFace* mf){
  310. tnsVector3d accum={0};
  311. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){
  312. laListItemPointer* next=lip->pNext; if(!next) next=mf->l.pFirst; tnsMEdge* me0=lip->p, *me1=next->p;
  313. tnsMVert* mv=tnsMMeshEdgeStartingVert(me0,me1); int fcount=0;
  314. for(laListItemPointer* el=mv->elink.pFirst;el;el=el->pNext){ tnsMEdge* ve=lip->p;
  315. if(ve->fl){ tnsVectorAccum3d(accum, ve->fl->n); fcount++; }
  316. if(ve->fr){ tnsVectorAccum3d(accum, ve->fr->n); fcount++; }
  317. }
  318. if(!fcount) accum[2]=1; else tnsNormalizeSelf3d(accum);
  319. tnsVectorSet3v(mv->n, accum);
  320. }
  321. }
  322. int tnsMMeshCalculateNormal(tnsMeshObject* mo){
  323. tnsMMeshClearExtraFlags(mo); int ran=0;
  324. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ if(!(mv->flags&TNS_MESH_FLAG_SELECTED)) continue;
  325. for(laListItemPointer* lip=mv->elink.pFirst; lip;lip=lip->pNext){
  326. tnsMEdge*me=lip->p; if((!me->fl) && (!me->fr)) continue;
  327. if(me->fl) tnsMMeshCalculateNormalFrom(me->fl); if(me->fr) tnsMMeshCalculateNormalFrom(me->fr); ran=1;
  328. }
  329. }
  330. //for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ if((!(mf->flags&TNS_MESH_FLAG_SELECTED))||(mf->flags&TNS_MESH_FLAG_PICKED)) continue;
  331. // tnsMMeshCalculateNormalFrom(mf); ran=1;
  332. //}
  333. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ if(!(mf->flags&TNS_MESH_FLAG_PICKED)) continue;
  334. tnsMMeshCalculateFaceVertNormal(mf); ran=1;
  335. }
  336. return ran;
  337. }
  338. void tnsMMeshEdgeAssignVerts(tnsMEdge* me,tnsMVert* mv1,tnsMVert* mv2){
  339. if(me->vl||me->vr){ return; } //if((me->vl==mv1&&me->vr=mv2) || (me->vl==mv2&&me->vr=mv1))
  340. me->vl=mv1; me->vr=mv2;
  341. lstAppendPointer(&me->vl->elink,me); lstAppendPointer(&me->vr->elink,me);
  342. }
  343. tnsMEdge* tnsMMeshVertShareEdge(tnsMVert* mv0, tnsMVert* mv1){
  344. for(laListItemPointer*lip=mv0->elink.pFirst;lip;lip=lip->pNext){ tnsMEdge* me=lip->p; if(tnsMMeshEdgeAnotherVert(me, mv0)==mv1) return me; } return 0;
  345. }
  346. int tnsMMeshEdgeHasVert(tnsMEdge* me, tnsMVert* mv){
  347. if(me->vl==mv || me->vr==mv) return 1; return 0;
  348. }
  349. tnsMVert* tnsMMeshEdgeShareVert(tnsMEdge* me0, tnsMEdge* me1){
  350. if(me0->vl==me1->vl || me0->vl==me1->vr) return me0->vl;
  351. if(me0->vr==me1->vl || me0->vr==me1->vr) return me0->vr;
  352. return 0;
  353. }
  354. tnsMVert* tnsMMeshEdgeAnotherVert(tnsMEdge* me, tnsVert* v){
  355. if(me->vl==v) return me->vr; if(me->vr==v) return me->vl;
  356. return 0;
  357. }
  358. tnsMVert* tnsMMeshEdgeStartingVert(tnsMEdge* me0, tnsMEdge* me1){
  359. tnsMVert* sv=tnsMMeshEdgeShareVert(me0,me1); if(!sv) return 0;
  360. return tnsMMeshEdgeAnotherVert(me0, sv);
  361. }
  362. void tnsMMeshFaceAddEdge(tnsMFace* mf, tnsMEdge* me){
  363. lstAppendPointer(&mf->l, me); mf->looplen++;
  364. if(!me->fl) me->fl=mf; elif(!me->fr) me->fr=mf;
  365. }
  366. void tnsMMeshFaceAddEdgeReplaceFace(tnsMFace* mf, tnsMEdge* me, tnsMFace* to_be_replaced){
  367. lstAppendPointer(&mf->l, me); mf->looplen++;
  368. if(me->fl==to_be_replaced) me->fl=mf; elif(me->fr==to_be_replaced) me->fr=mf;
  369. elif(!me->fl) me->fl=mf; elif(!me->fr) me->fr=mf;
  370. }
  371. tnsMFace* tnsMMeshFaceHasVert(tnsMFace* mf, tnsMVert* mv){
  372. if(!mf||!mv) return 0; for(laListItemPointer*lip=mf->l.pFirst;lip;lip=lip->pNext){ if(tnsMMeshEdgeAnotherVert(lip->p, mv)) return mf; }
  373. return 0;
  374. }
  375. tnsMFace* tnsMMeshVertsShareFace(tnsMVert* v1, tnsMVert* v2){
  376. tnsMFace* mf=0; for(laListItemPointer*lip=v1->elink.pFirst;lip;lip=lip->pNext){
  377. tnsMEdge* me=lip->p; if((mf=tnsMMeshFaceHasVert(me->fl, v2)) || (mf=tnsMMeshFaceHasVert(me->fr, v2))) return mf;
  378. } return 0;
  379. }
  380. int tnsMMeshSplitFace(tnsMeshObject* mo, tnsMFace* mf, tnsMEdge* me, tnsMFace** r_f1, tnsMFace** r_f2){
  381. tnsMEdge* NextE; laListItemPointer* NextLip, *StartLip=0, *EndLip=0; int guard=0;
  382. for(laListItemPointer*lip=mf->l.pFirst;lip;lip=NextLip){
  383. NextLip=lip->pNext?lip->pNext:mf->l.pFirst; NextE=NextLip->p;
  384. if(tnsMMeshEdgeHasVert(me,tnsMMeshEdgeShareVert(NextE,lip->p))){
  385. if(!StartLip) StartLip=NextLip;
  386. else{EndLip=NextLip; break;} }
  387. guard++; if(guard>mf->looplen) return 0; // me is not across mf.
  388. }
  389. tnsMFace* f1=tnsMMeshNewFace(mo);
  390. for(laListItemPointer*lip=StartLip;lip;lip=NextLip){ NextLip=lip->pNext?lip->pNext:mf->l.pFirst;
  391. if(lip==EndLip){ tnsMMeshFaceAddEdgeReplaceFace(f1, me, mf); break; } tnsMMeshFaceAddEdgeReplaceFace(f1, lip->p, mf);
  392. }
  393. tnsMFace* f2=tnsMMeshNewFace(mo);
  394. for(laListItemPointer*lip=EndLip;lip;lip=NextLip){ NextLip=lip->pNext?lip->pNext:mf->l.pFirst;
  395. if(lip==StartLip){ tnsMMeshFaceAddEdgeReplaceFace(f2, me, mf); break; } tnsMMeshFaceAddEdgeReplaceFace(f2, lip->p, mf);
  396. }
  397. tnsMMeshRemoveFaceOnly(mo, mf);
  398. if(r_f1){ *r_f1=f1; } if(r_f2){ *r_f2=f2; }
  399. //tnsPrintMeshTopology(mo);
  400. return 1;
  401. }
  402. tnsMEdge* tnsMMeshMakeEdge(tnsMeshObject* mo, tnsMVert* v1, tnsMVert* v2){
  403. for(laListItemPointer*lip=v1->elink.pFirst;lip;lip=lip->pNext){ if(tnsMMeshEdgeAnotherVert(lip->p, v1)==v2) return lip->p; }
  404. // for(laListItemPointer*lip=v2->elink.pFirst;lip;lip=lip->pNext){ if(tnsMMeshEdgeAnotherVert(lip->p, v2)==v1) return lip->p; } shouldn't need.
  405. tnsMFace* mf=tnsMMeshVertsShareFace(v1,v2);
  406. tnsMEdge* me=tnsMMeshNewEdge(mo); tnsMMeshEdgeAssignVerts(me, v1, v2);
  407. if(mf){ tnsMMeshSplitFace(mo, mf, me, 0,0); }
  408. return me;
  409. }
  410. int tnsMMeshFaceMatchesN(tnsMFace* mf, int ecount, laListHandle* eip){
  411. if(!mf||mf->looplen!=ecount) return 0; laListItemPointer* lipe=eip->pFirst;
  412. for(int i=0;i<ecount;i++){
  413. tnsMEdge* me=lipe->p; int found=0; lipe=lipe->pNext;
  414. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){
  415. if(lip->p==me){ found=1; break; }
  416. }
  417. if(!found){ return 0; }
  418. }
  419. return 1;
  420. }
  421. int tnsMMeshFaceMatches(tnsMFace* mf, int ecount, ...){
  422. if(!mf||mf->looplen!=ecount) return 0;
  423. va_list list; va_start(list, ecount);
  424. for(int i=0;i<ecount;i++){
  425. tnsMEdge* me=va_arg(list, tnsMEdge*); int found=0;
  426. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){
  427. if(lip->p==me){ found=1; break; }
  428. }
  429. if(!found){ va_end(list); return 0; }
  430. }
  431. va_end(list); return 1;
  432. }
  433. tnsMFace* tnsMMeshMakeFaceN(tnsMeshObject* mo, int count, laListHandle* vip, tnsMEdge** r_fallback_me){
  434. if(count<2){ return 0; }
  435. if(count==2){ tnsMEdge* me=tnsMMeshMakeEdge(mo,((laListItemPointer*)vip->pFirst)->p,((laListItemPointer*)vip->pLast)->p); if(r_fallback_me)*r_fallback_me=me; return 0; }
  436. laListHandle el={0};
  437. for(laListItemPointer*lip=vip->pFirst;lip;lip=lip->pNext){
  438. tnsMVert* mv=lip->p; laListItemPointer*nlip=lip->pNext?((laListItemPointer*)lip->pNext):vip->pFirst; tnsMVert* nextmv=nlip->p;
  439. lstAppendPointer(&el,tnsMMeshMakeEdge(mo,mv,nextmv));
  440. }
  441. tnsMEdge* e1=((laListItemPointer*)el.pFirst)->p;
  442. if(tnsMMeshFaceMatchesN(e1->fl, count, &el))return e1->fl; if(tnsMMeshFaceMatchesN(e1->fr, count, &el))return e1->fr;
  443. for(laListItemPointer* lip=el.pFirst;lip;lip=lip->pNext){ tnsMEdge*me=lip->p; if(me->fl&&me->fr) return 0; }
  444. tnsMFace* mf=tnsMMeshNewFace(mo);
  445. for(laListItemPointer* lip=el.pFirst;lip;lip=lip->pNext){ tnsMEdge*me=lip->p; tnsMMeshFaceAddEdge(mf, me); }
  446. while(lstPopPointer(&el));
  447. return mf;
  448. }
  449. tnsMFace* tnsMMeshMakeFace4v(tnsMeshObject* mo, tnsVert* v1,tnsVert* v2,tnsVert* v3,tnsVert* v4){
  450. tnsMEdge* e1=tnsMMeshMakeEdge(mo,v1,v2); tnsMEdge* e2=tnsMMeshMakeEdge(mo,v2,v3);
  451. tnsMEdge* e3=tnsMMeshMakeEdge(mo,v3,v4); tnsMEdge* e4=tnsMMeshMakeEdge(mo,v4,v1);
  452. if(tnsMMeshFaceMatches(e1->fl,4,e1,e2,e3,e4)) return e1->fl; if(tnsMMeshFaceMatches(e1->fr,4,e1,e2,e3,e4)) return e1->fr; //should not need more
  453. if((e1->fl&&e1->fr) || (e2->fl&&e2->fr) || (e3->fl&&e3->fr) || (e4->fl&&e4->fr)) return 0;
  454. tnsMFace* mf=tnsMMeshNewFace(mo);
  455. tnsMMeshFaceAddEdge(mf,e1); tnsMMeshFaceAddEdge(mf,e2);
  456. tnsMMeshFaceAddEdge(mf,e3); tnsMMeshFaceAddEdge(mf,e4);
  457. return mf;
  458. }
  459. int tnsMMeshLoopIsInverted(laListItemPointer* l){
  460. tnsMEdge* me=l->p; if(l->pNext){ tnsMEdge*next=((laListItemPointer*)l->pNext)->p; if(me->vr==tnsMMeshEdgeShareVert(me,next))return 0; return 1; }
  461. else{ tnsMEdge*prev=((laListItemPointer*)l->pPrev)->p; if(me->vl==tnsMMeshEdgeShareVert(prev,me))return 0; return 1; }
  462. }
  463. int tnsMMeshEdgeInsertVert(tnsMeshObject* mo, tnsMEdge* me, tnsMVert* mv, tnsMVert* ref_e1v_optional, tnsMEdge** r_e1, tnsMEdge** r_e2){
  464. if(mv->elink.pFirst||mv->elink.pLast||me->vl==mv||me->vl==mv) return 0;
  465. tnsMEdge* me1=tnsMMeshNewEdge(mo),*me2=tnsMMeshNewEdge(mo);
  466. me1->fl=me2->fl=me->fl; me1->fr=me2->fr=me->fr;
  467. tnsMMeshEdgeAssignVerts(me1,me->vl,mv); tnsMMeshEdgeAssignVerts(me2,mv,me->vr);
  468. laListItemPointer* lipa1=memAcquireSimple(sizeof(laListItemPointer)),*lipa2=memAcquireSimple(sizeof(laListItemPointer)); lipa1->p=me1; lipa2->p=me2;
  469. laListItemPointer* lipb1=memAcquireSimple(sizeof(laListItemPointer)),*lipb2=memAcquireSimple(sizeof(laListItemPointer)); lipb1->p=me1; lipb2->p=me2;
  470. if(me->fl) for(laListItemPointer* lip=me->fl->l.pFirst;lip;lip=lip->pNext){
  471. tnsMEdge*ie=lip->p; if(ie!=me) continue; if(tnsMMeshLoopIsInverted(lip)){ LA_SWAP(laListItemPointer*,lipa1,lipa2); }
  472. lstInsertItemBefore(&me->fl->l,lipa1,lip); lstInsertItemBefore(&me->fl->l,lipa2,lip); lstRemoveItem(&me->fl->l, lip); memLeave(lip); me->fl->looplen++;
  473. }
  474. if(me->fr) for(laListItemPointer* lip=me->fr->l.pFirst;lip;lip=lip->pNext){
  475. tnsMEdge*ie=lip->p; if(ie!=me) continue; if(tnsMMeshLoopIsInverted(lip)){ LA_SWAP(laListItemPointer*,lipb1,lipb2); }
  476. lstInsertItemBefore(&me->fr->l,lipb1,lip); lstInsertItemBefore(&me->fr->l,lipb2,lip); lstRemoveItem(&me->fr->l, lip); memLeave(lip); me->fr->looplen++;
  477. }
  478. me->fl=me->fr=0; tnsMMeshRemoveEdgeFace(mo,me);
  479. if(ref_e1v_optional&&tnsMMeshEdgeShareVert(me1, ref_e1v_optional)){ if(r_e1)*r_e1=me1; if(r_e2)*r_e2=me2; }else{ if(r_e1)*r_e1=me2; if(r_e2)*r_e2=me1; }
  480. //tnsPrintMeshTopology(mo);
  481. return 1;
  482. }
  483. tnsMVert* tnsMMeshEdgeInsertVertAt(tnsMeshObject* mo, tnsMEdge* me, real at, tnsMVert* ref_e1v_optional, tnsMEdge** r_e1, tnsMEdge** r_e2){
  484. if(!me||at<=0||at>=1) return 0; tnsMVert* mv=tnsMMeshNewVert(mo);
  485. tnsInterpolate3dv(me->vl->p, me->vr->p, at, mv->p);
  486. if(tnsMMeshEdgeInsertVert(mo,me,mv,ref_e1v_optional,r_e1,r_e2)) return mv; return 0;
  487. }
  488. void tnsMMeshRemoveFaceOnly(tnsMeshObject* mo, tnsMFace* mf){
  489. if(!mf) return; tnsMEdge* me;
  490. while(me=lstPopPointerLeave(&mf->l)){ if(me->fl==mf) me->fl=0; elif(me->fr==mf) me->fr=0; }
  491. lstRemoveItem(&mo->mf,mf); memLeave(mf); mo->totmf--;
  492. }
  493. void tnsMMeshRemoveEdgeFace(tnsMeshObject* mo, tnsMEdge* me){
  494. if(!me) return;
  495. tnsMMeshRemoveFaceOnly(mo, me->fl); tnsMMeshRemoveFaceOnly(mo, me->fr);
  496. lstRemovePointerLeave(&me->vl->elink, me); lstRemovePointerLeave(&me->vr->elink, me);
  497. lstRemoveItem(&mo->me,me); memLeave(me); mo->totme--;
  498. }
  499. void tnsMMeshRemoveVertEdgeFace(tnsMeshObject* mo, tnsMVert* mv){
  500. if(!mv) return; tnsMEdge* me;
  501. while(me=lstPopPointerLeave(&mv->elink)){ tnsMMeshRemoveEdgeFace(mo,me); }
  502. lstRemoveItem(&mo->mv,mv); memLeave(mv); mo->totmv--;
  503. }
  504. void tnsMMeshRefreshIndex(tnsMeshObject* mo){
  505. int i;
  506. i=0; for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ mv->i=i; i++; } mo->totmv=i;
  507. i=0; for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ me->i=i; i++; } mo->totme=i;
  508. i=0; for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ mf->i=i; i++; } mo->totmf=i;
  509. }
  510. void tnsClearMesh(tnsMeshObject* mo){
  511. arrFree(&mo->v, &mo->maxv); mo->totv=0;
  512. arrFree(&mo->e, &mo->maxe); mo->tote=0;
  513. if(mo->f) for(int i=0;i<mo->totf;i++){ if(mo->f[i].loop) free(mo->f[i].loop); }
  514. arrFree(&mo->f, &mo->maxf); mo->totf=0;
  515. }
  516. void tnsClearMMesh(tnsMeshObject* mo){
  517. tnsMFace* mf; tnsMEdge* me; tnsMVert* mv;
  518. while(mf=lstPopItem(&mo->mf)){ while(lstPopPointerLeave(&mf->l)); memLeave(mf); }
  519. while(me=lstPopItem(&mo->me)){ memLeave(me); }
  520. while(mv=lstPopItem(&mo->mv)){ while(lstPopPointerLeave(&mv->elink)); memLeave(mv); }
  521. mo->totmv=mo->totme=mo->totmf=0;
  522. }
  523. void tnsMMeshFromMesh(tnsMeshObject* mo){
  524. tnsClearMMesh(mo);
  525. tnsEdgeHash* eh=tnsCreateEdgeHash(mo->totv); //mo->totmv=mo->totv; mo->totme=mo->tote; mo->totmf=mo->totf;
  526. for(int i=0;i<mo->totf;i++){
  527. tnsFace* f=&mo->f[i];
  528. for(int j=0;j<f->looplen-1;j++){ tnsEdgeHashAddVertPair(eh, f->loop[j], f->loop[j+1]); }
  529. tnsEdgeHashAddVertPair(eh, f->loop[f->looplen-1], f->loop[0]);
  530. }
  531. for(int i=0;i<eh->max;i++){
  532. tnsEdgeHashVert* ehv=&eh->vl[i];
  533. for(int j=0;j<ehv->next;j++){ tnsMEdge*me=tnsMMeshNewEdge(mo); ehv->e[j].me=me; }
  534. }
  535. for(int i=0;i<mo->totv;i++){ tnsVert*v=&mo->v[i]; tnsMVert*mv=tnsMMeshNewVert(mo); eh->vl[i].mv=mv;
  536. tnsVectorSet3v(mv->p,mo->v[i].p); mv->flags=mo->v[i].flags; tnsVectorSet3v(mv->n,v->n); }
  537. for(int i=0;i<mo->totf;i++){
  538. tnsFace* f=&mo->f[i]; tnsMFace* mf=tnsMMeshNewFace(mo); mf->flags=f->flags;
  539. for(int j=0;j<f->looplen;j++){ int v2=j+1; if(j==f->looplen-1) v2=0;
  540. tnsEdgeHashEdge* ehe=tnsEdgeHashGetEdge(eh,f->loop[j],f->loop[v2]);
  541. tnsMEdge* me=ehe->me; tnsMMeshEdgeAssignVerts(me,eh->vl[f->loop[j]].mv,eh->vl[f->loop[v2]].mv);
  542. tnsMMeshFaceAddEdge(mf,me); tnsVectorSet3v(mf->n,f->n);
  543. }
  544. }
  545. tnsMMeshEnsureSelectionFromVerts(mo);
  546. tnsDestroyEdgeHash(eh);
  547. }
  548. void tnsMeshFromMMesh(tnsMeshObject* mo){
  549. tnsClearMesh(mo);
  550. tnsInitMesh(mo, mo->totmv, 0, mo->totmf); int i=0;
  551. /* Vertex index should already correct. */
  552. //for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ mv->i=i; i++; }
  553. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ tnsVert* v=tnsFillVert(mo, LA_COLOR3(mv->p)); tnsFillVertNormal(v,mv->n); v->flags=mv->flags; }
  554. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ tnsFace* f=tnsFillFace(mo, mf->looplen, -1); f->flags=mf->flags;
  555. int j=0; for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){
  556. laListItemPointer* next=lip->pNext; if(!next) next=mf->l.pFirst; tnsMEdge* me0=lip->p, *me1=next->p;
  557. tnsFillFaceLoop(f, j, tnsMMeshEdgeStartingVert(me0,me1)->i); j++;
  558. }
  559. tnsFillFaceNormal(f,mf->n);
  560. }
  561. mo->totv=mo->totmv; mo->totf=mo->totmf;
  562. mo->maxv=mo->totv; mo->maxe=mo->tote; mo->maxf=mo->totf;
  563. if((!mo->maxv) && mo->v) arrFree(&mo->v, &mo->maxv);
  564. if((!mo->maxe) && mo->e) arrFree(&mo->e, &mo->maxe);
  565. if((!mo->maxf) && mo->f) arrFree(&mo->f, &mo->maxf);
  566. tnsClearMMesh(mo);
  567. }
  568. void tnsMeshEnterEditMode(tnsMeshObject* mo){
  569. if(mo->Mode==TNS_MESH_EDIT_MODE) return;
  570. tnsMMeshFromMesh(mo);
  571. mo->Mode = TNS_MESH_EDIT_MODE;
  572. tnsInvalidateMeshBatch(mo);
  573. }
  574. void tnsMeshLeaveEditMode(tnsMeshObject* mo){
  575. if(mo->Mode==TNS_MESH_OBJECT_MODE) return;
  576. tnsMeshFromMMesh(mo);
  577. mo->Mode = TNS_MESH_OBJECT_MODE;
  578. tnsInvalidateMeshBatch(mo);
  579. }
  580. int tnsMMeshAnySelected(tnsMeshObject* mo){
  581. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ if(mv->flags&TNS_MESH_FLAG_SELECTED) return 1; }
  582. for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ if(me->flags&TNS_MESH_FLAG_SELECTED) return 1; }
  583. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ if(mf->flags&TNS_MESH_FLAG_SELECTED) return 1; } return 0;
  584. }
  585. void tnsMMeshClearExtraFlags(tnsMeshObject* mo){
  586. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ mv->flags&=(~TNS_MESH_FLAG_PICKED); }
  587. for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ me->flags&=(~TNS_MESH_FLAG_PICKED); /*me->flags&=(~TNS_MESH_FLAG_LOOP_REVERSE);*/ }
  588. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ mf->flags&=(~TNS_MESH_FLAG_PICKED); }
  589. }
  590. void tnsMMeshDeselectAll(tnsMeshObject* mo){
  591. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ mv->flags&=(~TNS_MESH_FLAG_SELECTED); }
  592. for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ me->flags&=(~TNS_MESH_FLAG_SELECTED); }
  593. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ mf->flags&=(~TNS_MESH_FLAG_SELECTED); }
  594. }
  595. void tnsMMeshSelectAll(tnsMeshObject* mo){
  596. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ mv->flags|=TNS_MESH_FLAG_SELECTED; }
  597. for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ me->flags|=TNS_MESH_FLAG_SELECTED; }
  598. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ mf->flags|=TNS_MESH_FLAG_SELECTED; }
  599. }
  600. void tnsMMeshSelectVert(tnsMeshObject* mo, tnsMVert* mv, int select, int toggle){
  601. if(!mo) return;
  602. if(toggle) tnsMMeshSelectVert(mo,mv,(mv->flags&TNS_MESH_FLAG_SELECTED?0:1),0);
  603. elif(select) mv->flags|=TNS_MESH_FLAG_SELECTED; else mv->flags&=(~TNS_MESH_FLAG_SELECTED);
  604. }
  605. void tnsMMeshSelectEdge(tnsMeshObject* mo, tnsMEdge* me, int select, int toggle){
  606. if(!mo) return;
  607. if(toggle) tnsMMeshSelectEdge(mo,me,(me->flags&TNS_MESH_FLAG_SELECTED?0:1),0);
  608. elif(select) me->flags|=TNS_MESH_FLAG_SELECTED; else me->flags&=(~TNS_MESH_FLAG_SELECTED);
  609. }
  610. void tnsMMeshEnsureSelectionFromVerts(tnsMeshObject* mo){
  611. for(tnsMEdge* me=mo->me.pFirst;me;me=me->Item.pNext){ me->flags&=(~TNS_MESH_FLAG_SELECTED);
  612. if(me->vl->flags&me->vr->flags&TNS_MESH_FLAG_SELECTED) me->flags|=TNS_MESH_FLAG_SELECTED;
  613. }
  614. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ int sel=1; mf->flags&=(~TNS_MESH_FLAG_SELECTED);
  615. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){ tnsMEdge*me=lip->p; if(!(me->flags&TNS_MESH_FLAG_SELECTED)){ sel=0; break; } }
  616. if(sel){ mf->flags|=TNS_MESH_FLAG_SELECTED; }
  617. }
  618. }
  619. void tnsMMeshEnsureSelectionFromEdges(tnsMeshObject* mo){
  620. for(tnsMVert* mv=mo->mv.pFirst;mv;mv=mv->Item.pNext){ mv->flags&=(~TNS_MESH_FLAG_SELECTED);
  621. for(laListItemPointer* lip=mv->elink.pFirst;lip;lip=lip->pNext){ tnsMEdge*me=lip->p; if(me->flags&TNS_MESH_FLAG_SELECTED){ mv->flags|=TNS_MESH_FLAG_SELECTED; break; } }
  622. }
  623. for(tnsMFace* mf=mo->mf.pFirst;mf;mf=mf->Item.pNext){ int sel=1; mf->flags&=(~TNS_MESH_FLAG_SELECTED);
  624. for(laListItemPointer* lip=mf->l.pFirst;lip;lip=lip->pNext){ tnsMEdge*me=lip->p; if(!(me->flags&TNS_MESH_FLAG_SELECTED)){ sel=0; break; } }
  625. if(sel){ mf->flags|=TNS_MESH_FLAG_SELECTED; }
  626. }
  627. }
  628. void tnsMMeshEnsureSelection(tnsMeshObject* mo, int SelectMode){
  629. if(SelectMode==LA_CANVAS_SELECT_MODE_VERTS){ tnsMMeshEnsureSelectionFromVerts(mo); }
  630. elif(SelectMode==LA_CANVAS_SELECT_MODE_EDGES){ tnsMMeshEnsureSelectionFromEdges(mo); }
  631. }
  632. tnsMeshObject *tnsCreateMeshEmpty(tnsObject *under, char *Name, real AtX, real AtY, real AtZ){
  633. tnsMeshObject *mo = memAcquireHyper(sizeof(tnsMeshObject));
  634. tnsInitObjectBase(&mo->Base, under, Name, TNS_OBJECT_MESH, AtX, AtY, AtZ, 0, 0, 0, 1.0f, TNS_ROTATION_XYZ_EULER, 1.0f);
  635. return mo;
  636. }
  637. tnsMeshObject *tnsCreateMeshPlane(tnsObject *under, char *Name, real AtX, real AtY, real AtZ, real size){
  638. tnsMeshObject *mo=tnsCreateMeshEmpty(under, Name, AtX, AtY, AtZ);
  639. tnsInitMeshPlane(mo, size);
  640. tnsInvalidateMeshBatch(mo);
  641. return mo;
  642. }