| commit | author | age | ||
| d7639a | 1 | #include<stdlib.h> |
| SP | 2 | #include "general.h" |
| 3 | #include "vertex.h" | |
| 4 | #include <stdio.h> | |
| 5 | ts_bool init_cell_list(ts_cell_list *clist, ts_double stepsize){ | |
| 6 | ts_uint i; | |
| 7 | ts_uint nocells=clist->ncmax[0]*clist->ncmax[1]*clist->ncmax[2]; | |
| 8 | clist->cell=malloc(nocells*sizeof(ts_cell)); | |
| 9 | clist->dcell=1.0/(1.0 + stepsize); | |
| 10 | clist->shift=(ts_double) clist->ncmax[0]/2; | |
| 11 | clist->cellno=nocells; | |
| 12 | for(i=0;i<nocells;i++){ | |
| 13 | clist->cell[i].idx=i+1; // We enumerate cells! Probably never required! | |
| 14 | clist->cell[i].nvertex=0; | |
| 15 | clist->cell[i].vertex=NULL; | |
| 16 | } | |
| 17 | return TS_SUCCESS; | |
| 18 | } | |
| 19 | ||
| 20 | ts_bool cell_list_free(ts_cell_list *clist){ | |
| 21 | ts_uint i; | |
| 22 | ts_uint nocells=clist->ncmax[0]*clist->ncmax[1]*clist->ncmax[2]; | |
| 23 | ||
| 24 | for(i=0;i<nocells;i++) | |
| 25 | if(clist->cell->vertex != NULL) free(clist->cell->vertex); | |
| 26 | free(clist->cell); | |
| 27 | ||
| 28 | return TS_SUCCESS; | |
| 29 | } | |
| 30 | ||
| 31 | inline ts_uint vertex_self_avoidance(ts_vesicle *vesicle, ts_vertex *vtx){ | |
| 32 | ts_uint i,cellidx; | |
| 33 | ts_uint ncx, ncy,ncz; | |
| 34 | ||
| 35 | ncx=(ts_uint)((vtx->x-vesicle->cm[0])*vesicle->clist.dcell+vesicle->clist.shift); | |
| 36 | ncy=(ts_uint)((vtx->y-vesicle->cm[1])*vesicle->clist.dcell+vesicle->clist.shift); | |
| 37 | ncz=(ts_uint)((vtx->z-vesicle->cm[2])*vesicle->clist.dcell+vesicle->clist.shift); | |
| 38 | // fprintf(stderr,"(ncx,ncy,ncz)=(%i %i %i)\t",ncx,ncy,ncz); | |
| 39 | // fprintf(stderr,"(ncxmax,ncymax,nczmax)=(%i %i %i)\n",vesicle->clist.ncmax[0], vesicle->clist.ncmax[1], vesicle->clist.ncmax[2]); | |
| 40 | if(ncx == vesicle->clist.ncmax[0]-1 || ncx == 2){ | |
| 41 | fatal("Vesicle is positioned outside the cell covered area. Coordinate x is the problem.",1500); | |
| 42 | } | |
| 43 | if(ncy == vesicle->clist.ncmax[1]-1 || ncy == 2){ | |
| 44 | fatal("Vesicle is positioned outside the cell covered area. Coordinate y is the problem.",1500); | |
| 45 | } | |
| 46 | if(ncz == vesicle->clist.ncmax[2]-1 || ncz == 2){ | |
| 47 | fatal("Vesicle is positioned outside the cell covered area. Coordinate z is the problem.",1500); | |
| 48 | } | |
| 49 | cellidx=ncz+(ncy-1)*vesicle->clist.ncmax[2] + | |
| 50 | (ncx-1)*vesicle->clist.ncmax[2]* vesicle->clist.ncmax[1] - 1; // -1 is because of 0 based indexing | |
| 51 | return cellidx; | |
| 52 | } | |
| 53 | ||
| 54 | ||
| 55 | ||
| 56 | ts_bool cell_add_vertex(ts_cell *cell, ts_vertex *vtx){ | |
| 57 | ||
| 58 | cell->nvertex++; | |
| 59 | cell->vertex=realloc(cell->vertex,cell->nvertex*sizeof(ts_vertex *)); | |
| 60 | if(vtx->neigh == NULL){ | |
| 61 | fatal("Reallocation of memory failed during insertion of vertex neighbour in vertex_add_neighbour",3); | |
| 62 | } | |
| 63 | cell->vertex[cell->nvertex-1]=vtx; | |
| 64 | ||
| 65 | return TS_SUCCESS; | |
| 66 | } | |
| 67 | ||
| 68 | ts_bool cell_list_cell_ocupation_clear(ts_cell_list *clist){ | |
| 69 | ts_uint i; | |
| 70 | for(i=0;i<clist->cellno;i++){ | |
| 71 | if(clist->cell[i].vertex != NULL){ | |
| 72 | free(clist->cell[i].vertex); | |
| 73 | clist->cell[i].vertex=NULL; | |
| 74 | } | |
| 75 | clist->cell[i].nvertex=0; | |
| 76 | } | |
| 77 | return TS_SUCCESS; | |
| 78 | } | |
| 79 | ||
| 80 | ts_bool cell_occupation_number_and_internal_proximity(ts_cell_list *clist, ts_uint cellidx, ts_vertex *vtx, ts_vertex *tvtx){ | |
| 81 | ts_uint ncx,ncy,ncz,remainder,cell_occupation; | |
| 82 | ts_uint i,j,k,l,neigh_cidx,mcell; | |
| 83 | ts_double dist; | |
| 84 | ncx=(cellidx+1)/(clist->ncmax[2]*clist->ncmax[1])+1; | |
| 85 | remainder=(cellidx+1)%(clist->ncmax[2]*clist->ncmax[1]); | |
| 86 | ncy=remainder/clist->ncmax[2]+1; | |
| 87 | ncz=remainder%clist->ncmax[2]; | |
| 88 | // fprintf(stderr,"here are ncx,ncy,ncz=%i,%i,%i\n",ncx,ncy,ncz); | |
| 89 | ||
| 90 | for(i=ncx-1;i<=ncx+1;i++){ | |
| 91 | for(j=ncy-1;j<=ncy+1;j++){ | |
| 92 | for(k=ncz-1;k<=ncz+1;k++){ | |
| 93 | neigh_cidx=k+(j-1)*clist->ncmax[2]+(i-1)*clist->ncmax[2]*clist->ncmax[1] -1; | |
| 94 | // fprintf(stderr,"neigh_cell_index=%i\n",neigh_cidx); | |
| 95 | cell_occupation=clist->cell[neigh_cidx].nvertex; | |
| 96 | // fprintf(stderr, "cell_occupation=%i\n",cell_occupation); | |
| 97 | if(cell_occupation>clist->max_occupancy){ | |
| 98 | fatal("Neighbouring cell occupation more than set max_occupancy value.",2000); | |
| 99 | } | |
| 100 | // Now we check whether we didn't come close to some other vertices in the same | |
| 101 | // cell! | |
| 102 | if(cell_occupation>1){ | |
| 103 | for(l=0;l<cell_occupation;l++){ | |
| 104 | if(clist->cell[neigh_cidx].vertex[l]!=vtx){ | |
| 105 | // fprintf(stderr,"calling dist on vertex %i\n",l); | |
| 106 | dist=vertex_distance_sq(clist->cell[neigh_cidx].vertex[l],tvtx); | |
| 107 | // fprintf(stderr,"dist was %f\n",dist); | |
| 108 | if(dist<1) return TS_FAIL; | |
| 109 | } | |
| 110 | } | |
| 111 | } | |
| 112 | } | |
| 113 | } | |
| 114 | } | |
| 115 | ||
| 116 | return TS_SUCCESS; | |
| 117 | } | |
