trisurf-ng.git - Gitblit

Merge branch 'master' of bitbucket.org:samop/trisurf-ng

Samo Penic

2016-07-11 80f2a33e4b55c7259bdb4bff66a0ce12b96edd80

commit \| author \| age
7f6076	1	/* vim: set ts=4 sts=4 sw=4 noet : */
7958e9	2	#include<stdlib.h>
SP	3	#include<math.h>
	4	#include<stdio.h>
	5	#include "general.h"
	6	#include "vertex.h"
	7	#include "bond.h"
	8	#include "vesicle.h"
	9	#include "vertex.h"
	10	#include "triangle.h"
	11	#include "initial_distribution.h"
f74313	12	#include "energy.h"
1ab449	13	#include "poly.h"
8a6614	14	#include "io.h"
dc77e8	15	#include "sh.h"
459ff9	16	#include "shcomplex.h"
7958e9	17
SP	18	ts_vesicle *initial_distribution_dipyramid(ts_uint nshell, ts_uint ncmax1, ts_uint ncmax2, ts_uint ncmax3, ts_double stepsize){
1ab449	19	ts_fprintf(stdout,"Starting initial_distribution on vesicle with %u shells!...\n",nshell);
7958e9	20	ts_bool retval;
1ab449	21	ts_uint no_vertices=5nshellnshell+2;
SP	22	ts_vesicle *vesicle=init_vesicle(no_vertices,ncmax1,ncmax2,ncmax3,stepsize);
	23	vesicle->nshell=nshell;
	24	//retval = vtx_set_global_values(vesicle);
	25	retval = pentagonal_dipyramid_vertex_distribution(vesicle->vlist);
	26	retval = init_vertex_neighbours(vesicle->vlist);
	27	vesicle->vlist = init_sort_neighbours(vesicle->blist,vesicle->vlist);
b01cc1	28	// retval = init_vesicle_bonds(vesicle); // bonds are created in sort_neigh
1ab449	29	retval = init_triangles(vesicle);
SP	30	retval = init_triangle_neighbours(vesicle);
	31	retval = init_common_vertex_triangle_neighbours(vesicle);
	32	retval = init_normal_vectors(vesicle->tlist);
	33	retval = mean_curvature_and_energy(vesicle);
	34	ts_fprintf(stdout,"initial_distribution finished!\n");
41a035	35	if(retval);
7958e9	36	return vesicle;
SP	37	}
	38
	39
1ab449	40
SP	41	ts_vesicle create_vesicle_from_tape(ts_tape tape){
	42	ts_vesicle *vesicle;
bcf455	43
1ab449	44	vesicle=initial_distribution_dipyramid(tape->nshell,tape->ncxmax,tape->ncymax,tape->nczmax,tape->stepsize);
698ae1	45	vesicle->tape=tape;
SP	46	set_vesicle_values_from_tape(vesicle);
	47	return vesicle;
	48	}
	49
	50	ts_bool set_vesicle_values_from_tape(ts_vesicle *vesicle){
58230a	51	// Nucleus:
698ae1	52	ts_vertex *vtx;
SP	53	ts_tape *tape=vesicle->tape;
fe24d2	54	vesicle->R_nucleus=tape->R_nucleus*tape->R_nucleus;
37791b	55	vesicle->R_nucleusX=tape->R_nucleusX*tape->R_nucleusX;
SP	56	vesicle->R_nucleusY=tape->R_nucleusY*tape->R_nucleusY;
	57	vesicle->R_nucleusZ=tape->R_nucleusZ*tape->R_nucleusZ;
fe24d2	58	vesicle->clist->dmin_interspecies = tape->dmin_interspecies*tape->dmin_interspecies;
bcf455	59
58230a	60	//Initialize grafted polymers (brush):
624f81	61	vesicle->poly_list=init_poly_list(tape->npoly,tape->nmono, vesicle->vlist, vesicle);
1ab449	62	vesicle->spring_constant=tape->kspring;
SP	63	poly_assign_spring_const(vesicle);
bcf455	64
58230a	65	//Initialize filaments (polymers inside the vesicle):
M	66	vesicle->filament_list=init_poly_list(tape->nfil,tape->nfono, NULL, vesicle);
bcf455	67	poly_assign_filament_xi(vesicle,tape);
58230a	68
bcf455	69	ts_uint i,j;
M	70	for(i=0;i<vesicle->filament_list->n;i++){
	71	for(j=0;j<vesicle->filament_list->poly[i]->blist->n;j++){
	72	bond_vector(vesicle->filament_list->poly[i]->blist->bond[j]);
	73	vesicle->filament_list->poly[i]->blist->bond[j]->bond_length = sqrt(vtx_distance_sq(vesicle->filament_list->poly[i]->blist->bond[j]->vtx1,vesicle->filament_list->poly[i]->blist->bond[j]->vtx2));
	74	}
58230a	75	}
bcf455	76
M	77	for(i=0;i<vesicle->filament_list->n;i++){
	78	for(j=0;j<vesicle->filament_list->poly[i]->vlist->n;j++){
	79	vtx = vesicle->filament_list->poly[i]->vlist->vtx[j];
	80	if(vtx->bond_no == 2){
	81	vtx->energy = -(vtx->bond[0]->xvtx->bond[1]->x + vtx->bond[0]->yvtx->bond[1]->y + vtx->bond[0]->z*vtx->bond[1]->z)/vtx->bond[0]->bond_length/vtx->bond[1]->bond_length;
	82	}
	83	}
58230a	84	}
bcf455	85
ea1cce	86	for(i=0;i<vesicle->filament_list->n;i++){
M	87	vertex_list_assign_id(vesicle->filament_list->poly[i]->vlist,TS_ID_FILAMENT);
	88	}
bcf455	89
58230a	90	// vesicle->spring_constant=tape->kspring;
M	91	// poly_assign_spring_const(vesicle);
	92
1ab449	93
SP	94	vesicle->nshell=tape->nshell;
	95	vesicle->dmax=tape->dmaxtape->dmax; / dmax^2 in the vesicle dmax variable */
	96	vesicle->bending_rigidity=tape->xk0;
	97	vtx_set_global_values(vesicle); /* make xk0 default value for every vertex */
f4d6ca	98	// ts_fprintf(stdout, "Tape setting: xk0=%e\n",tape->xk0);
1ab449	99	vesicle->stepsize=tape->stepsize;
SP	100	vesicle->clist->ncmax[0]=tape->ncxmax;
	101	vesicle->clist->ncmax[1]=tape->ncymax;
	102	vesicle->clist->ncmax[2]=tape->nczmax;
	103	vesicle->clist->max_occupancy=8; /* hard coded max occupancy? */
	104
	105	vesicle->pressure= tape->pressure;
	106	vesicle->pswitch=tape->pswitch;
632960	107	if(tape->shc>0){
459ff9	108	vesicle->sphHarmonics=complex_sph_init(vesicle->vlist,tape->shc);
632960	109	}
SP	110	else {
	111	vesicle->sphHarmonics=NULL;
	112	}
698ae1	113	return TS_SUCCESS;
1ab449	114
SP	115	}
	116
	117
	118
	119
	120
7958e9	121	ts_bool pentagonal_dipyramid_vertex_distribution(ts_vertex_list *vlist){
SP	122	/* Some often used relations */
	123	const ts_double s1= sin(2.0*M_PI/5.0);
	124	const ts_double s2= sin(4.0*M_PI/5.0);
	125	const ts_double c1= cos(2.0*M_PI/5.0);
	126	const ts_double c2= cos(4.0*M_PI/5.0);
	127
	128	/* Calculates projection lenght of an edge bond to pentagram plane */
fab2ad	129	const ts_double xl0=DEF_A0/(2.0*sin(M_PI/5.0));
7958e9	130	#ifdef TS_DOUBLE_DOUBLE
fab2ad	131	const ts_double z0=sqrt(pow(DEF_A0,2)-pow(xl0,2));
7958e9	132	#endif
SP	133	#ifdef TS_DOUBLE_FLOAT
fab2ad	134	const ts_double z0=sqrtf(powf(DEF_A0,2)-powf(xl0,2));
7958e9	135	#endif
SP	136	#ifdef TS_DOUBLE_LONGDOUBLE
fab2ad	137	const ts_double z0=sqrtl(powl(DEF_A0,2)-powl(xl0,2));
7958e9	138	#endif
SP	139	// const z0=sqrt(A0A0 -xl0xl0); /* I could use pow function but if pow is used make a check on the float type. If float then powf, if long double use powl */
	140
	141	/placeholder for the pointer to vertex datastructure list... DIRTY: actual pointer points towards invalid address, one position before actual beginning of the list... This is to solve the difference between 1 based indexing in original program in fortran and 0 based indexing in C. All algorithms remain unchanged because of this!/
	142	ts_vertex **vtx=vlist->vtx -1 ;
	143
	144
	145	ts_uint nshell=(ts_uint)( sqrt((ts_double)(vlist->n-2)/5));
	146	// printf("nshell=%u\n",nshell);
	147	ts_uint i,n0; // some for loop prereq
	148	ts_int j,k;
	149	ts_double dx,dy; // end loop prereq
	150
	151	/* topmost vertex */
8f6a69	152	vtx[1]->x=0.0;
SP	153	vtx[1]->y=0.0;
	154	vtx[1]->z=z0*(ts_double)nshell;
7958e9	155
SP	156	/* starting from to in circular order on pentagrams */
	157	for(i=1;i<=nshell;i++){
	158	n0=2+5i(i-1)/2; //-1 would be for the reason that C index starts from 0
8f6a69	159	vtx[n0]->x=0.0;
SP	160	vtx[n0]->y=(ts_double)i*xl0;
	161	vtx[n0+i]->x=vtx[n0]->y*s1;
	162	vtx[n0+i]->y=vtx[n0]->y*c1;
	163	vtx[n0+2i]->x=vtx[n0]->ys2;
	164	vtx[n0+2i]->y=vtx[n0]->yc2;
	165	vtx[n0+3i]->x=-vtx[n0+2i]->x;
	166	vtx[n0+3i]->y=vtx[n0+2i]->y;
	167	vtx[n0+4*i]->x=-vtx[n0+i]->x;
	168	vtx[n0+4*i]->y=vtx[n0+i]->y;
7958e9	169	}
SP	170
	171	/* vertexes on the faces of the dipyramid */
	172	for(i=1;i<=nshell;i++){
	173	n0=2+5i(i-1)/2; // -1 would be because of C!
	174	for(j=1;j<=i-1;j++){
8f6a69	175	dx=(vtx[n0]->x-vtx[n0+4*i]->x)/(ts_double)i;
SP	176	dy=(vtx[n0]->y-vtx[n0+4*i]->y)/(ts_double)i;
	177	vtx[n0+4i+j]->x=(ts_double)jdx+vtx[n0+4*i]->x;
	178	vtx[n0+4i+j]->y=(ts_double)jdy+vtx[n0+4*i]->y;
7958e9	179	}
SP	180	for(k=0;k<=3;k++){ // I would be worried about zero starting of for
8f6a69	181	dx=(vtx[n0+(k+1)i]->x - vtx[n0+ki]->x)/(ts_double) i;
SP	182	dy=(vtx[n0+(k+1)i]->y - vtx[n0+ki]->y)/(ts_double) i;
7958e9	183	for(j=1; j<=i-1;j++){
8f6a69	184	vtx[n0+ki+j]->x= (ts_double)jdx+vtx[n0+k*i]->x;
SP	185	vtx[n0+ki+j]->y= (ts_double)jdy+vtx[n0+k*i]->y;
7958e9	186	}
SP	187	}
	188	}
	189
	190	for(i=1;i<=nshell;i++){
	191	n0= 2+ 5i(i-1)/2;
	192	for(j=0;j<=5*i-1;j++){
8f6a69	193	vtx[n0+j]->z= z0*(ts_double)(nshell-i); // I would be worried about zero starting of for
7958e9	194	}
SP	195	}
	196
	197	/* for botom part of dipyramide we calculate the positions of vertices */
	198	for(i=2+5nshell(nshell+1)/2;i<=vlist->n;i++){
8f6a69	199	vtx[i]->x=vtx[vlist->n - i +1]->x;
SP	200	vtx[i]->y=vtx[vlist->n - i +1]->y;
	201	vtx[i]->z=-vtx[vlist->n - i +1]->z;
7958e9	202	}
SP	203
	204	for(i=1;i<=vlist->n;i++){
	205	for(j=1;j<=vlist->n;j++){
	206	if(i!=j && vtx_distance_sq(vtx[i],vtx[j])<0.001){
	207	printf("Vertices %u and %u are the same!\n",i,j);
	208	}
	209	}
	210	}
	211	return TS_SUCCESS;
	212	}
	213
	214
	215
	216	ts_bool init_vertex_neighbours(ts_vertex_list *vlist){
	217	ts_vertex **vtx=vlist->vtx -1; // take a look at dipyramid function for comment.
	218	const ts_double eps=0.001; //TODO: find out if you can use EPS from math.h
	219	ts_uint i,j;
	220	ts_double dist2; // Square of distance of neighbours
	221	/this is not required if we zero all data in vertex structure at initialization /
	222	/if we force zeroing at initialization this for loop can safely be deleted /
	223	//for(i=1;i<=vlist->n;i++){
	224	// vtx[i].neigh_no=0;
	225	//}
	226	for(i=1;i<=vlist->n;i++){
	227	for(j=1;j<=vlist->n;j++){
	228	dist2=vtx_distance_sq(vtx[i],vtx[j]);
fab2ad	229	if( (dist2>eps) && (dist2<(DEF_A0*DEF_A0+eps))){
7958e9	230	//if it is close enough, but not too much close (solves problem of comparing when i==j)
SP	231	vtx_add_neighbour(vtx[i],vtx[j]);
	232	}
	233	}
	234	// printf ("vertex %u ima %u sosedov!\n",i,vtx[i]->data->neigh_no);
	235	}
	236
	237	return TS_SUCCESS;
	238	}
	239
b01cc1	240	// TODO: with new datastructure can be rewritten. Partially it is done, but it is complicated.
SP	241	ts_vertex_list init_sort_neighbours(ts_bond_list blist,ts_vertex_list *vlist){
7958e9	242	ts_vertex **vtx=vlist->vtx -1; // take a look at dipyramid function for comment.
SP	243	ts_uint i,l,j,jj,jjj,k=0;
	244	ts_double eps=0.001; // Take a look if EPS from math.h can be used
	245
	246	/lets initialize memory for temporary vertex_list. Should we write a function instead /
b01cc1	247	ts_vertex_list *tvlist=vertex_list_copy(vlist);
7958e9	248	ts_vertex *tvtx=tvlist->vtx -1; / again to compensate for 0-indexing */
SP	249
	250	ts_double dist2; // Square of distance of neighbours
	251	ts_double direct; // Something, dont know what, but could be normal of some kind
	252	for(i=1;i<=vlist->n;i++){
	253	k++; // WHY i IS NOT GOOD??
8f6a69	254	vtx_add_cneighbour(blist,tvtx[k], tvtx[vtx[i]->neigh[0]->idx+1]); //always add 1st
7958e9	255	jjj=1;
SP	256	jj=1;
8f6a69	257	for(l=2;l<=vtx[i]->neigh_no;l++){
SP	258	for(j=2;j<=vtx[i]->neigh_no;j++){
	259	dist2=vtx_distance_sq(vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
	260	direct=vtx_direct(vtx[i],vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
	261	// TODO: check if fabs can be used with all floating point types!!
fab2ad	262	if( (fabs(dist2-DEF_A0*DEF_A0)<=eps) && (direct>0.0) && (j!=jjj) ){
8f6a69	263	vtx_add_cneighbour(blist,tvtx[k],tvtx[vtx[i]->neigh[j-1]->idx+1]);
7958e9	264	jjj=jj;
SP	265	jj=j;
	266	break;
	267	}
	268	}
	269	}
	270	}
b01cc1	271	/* We use the temporary vertex for our main vertices and we abandon main
SP	272	* vertices, because their neighbours are not correctly ordered */
	273	// tvtx=vlist->vtx;
	274	// vlist->vtx=tvtx;
	275	// tvlist->vtx=vtx;
	276	vtx_list_free(vlist);
	277	/* Let's make a check if the number of bonds is correct */
	278	if((blist->n)!=3*(tvlist->n-2)){
	279	ts_fprintf(stderr,"Number of bonds is %u should be %u!\n", blist->n, 3*(tvlist->n-2));
	280	fatal("Number of bonds is not 3*(no_vertex-2).",4);
7958e9	281	}
SP	282
b01cc1	283	return tvlist;
7958e9	284	}
SP	285
	286
	287	ts_bool init_vesicle_bonds(ts_vesicle *vesicle){
	288	ts_vertex_list *vlist=vesicle->vlist;
	289	ts_bond_list *blist=vesicle->blist;
	290	ts_vertex **vtx=vesicle->vlist->vtx - 1; // Because of 0 indexing
	291	/* lets make correct clockwise ordering of in nearest neighbour list */
	292	ts_uint i,j,k;
	293	for(i=1;i<=vlist->n;i++){
	294	for(j=i+1;j<=vlist->n;j++){
8f6a69	295	for(k=0;k<vtx[i]->neigh_no;k++){ // has changed 0 to < instead of 1 and <=
SP	296	if(vtx[i]->neigh[k]==vtx[j]){ //if addresses matches it is the same
7958e9	297	bond_add(blist,vtx[i],vtx[j]);
SP	298	break;
	299	}
	300	}
	301	}
	302	}
	303	/* Let's make a check if the number of bonds is correct */
	304	if((blist->n)!=3*(vlist->n-2)){
	305	ts_fprintf(stderr,"Number of bonds is %u should be %u!\n", blist->n, 3*(vlist->n-2));
	306	fatal("Number of bonds is not 3*(no_vertex-2).",4);
	307	}
	308	return TS_SUCCESS;
	309	}
	310
	311
	312
	313	ts_bool init_triangles(ts_vesicle *vesicle){
	314	ts_uint i,j,jj,k;
	315	ts_vertex **vtx=vesicle->vlist->vtx -1; // difference between 0 indexing and 1 indexing
	316	ts_triangle_list *tlist=vesicle->tlist;
	317	ts_double dist, direct;
	318	ts_double eps=0.001; // can we use EPS from math.h?
	319	k=0;
	320	for(i=1;i<=vesicle->vlist->n;i++){
8f6a69	321	for(j=1;j<=vtx[i]->neigh_no;j++){
SP	322	for(jj=1;jj<=vtx[i]->neigh_no;jj++){
7958e9	323	// ts_fprintf(stderr,"%u: (%u,%u) neigh_no=%u ",i,j,jj,vtx[i].neigh_no);
SP	324	// ts_fprintf(stderr,"%e, %e",vtx[i].neigh[j-1]->x,vtx[i].neigh[jj-1]->x);
8f6a69	325	dist=vtx_distance_sq(vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
SP	326	direct=vtx_direct(vtx[i],vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
	327	// TODO: same as above
fab2ad	328	if(fabs(dist-DEF_A0*DEF_A0)<=eps && direct < 0.0 && vtx[i]->neigh[j-1]->idx+1 > i && vtx[i]->neigh[jj-1]->idx+1 >i){
8f6a69	329	triangle_add(tlist,vtx[i],vtx[i]->neigh[j-1],vtx[i]->neigh[jj-1]);
7958e9	330	}
SP	331	}
	332	}
	333	}
	334	/* We check if all triangles have 3 vertices and if the number of triangles
	335	* matches the theoretical value.
	336	*/
	337	for(i=0;i<tlist->n;i++){
	338	k=0;
	339	for(j=0;j<3;j++){
41a035	340	if(tlist->tria[i]->vertex[j]!=NULL)
7958e9	341	k++;
SP	342	}
	343	if(k!=3){
8f6a69	344	fatal("Some triangles have less than 3 vertices..",4);
7958e9	345	}
SP	346	}
	347	if(tlist->n!=2*(vesicle->vlist->n -2)){
	348	ts_fprintf(stderr,"The number of triangles is %u but should be %u!\n",tlist->n,2*(vesicle->vlist->n -2));
	349	fatal("The number of triangles doesn't match 2*(no_vertex -2).",4);
	350	}
	351	return TS_SUCCESS;
	352	}
	353
	354
	355
	356	ts_bool init_triangle_neighbours(ts_vesicle *vesicle){
	357	ts_uint i,j,nobo;
	358	ts_vertex i1,i2,i3,j1,j2,j3;
	359	// ts_vertex **vtx=vesicle->vlist->vtx -1; // difference between 0 indexing and 1 indexing
	360	ts_triangle_list *tlist=vesicle->tlist;
	361	ts_triangle **tria=tlist->tria -1;
	362	nobo=0;
	363	for(i=1;i<=tlist->n;i++){
41a035	364	i1=tria[i]->vertex[0];
SP	365	i2=tria[i]->vertex[1];
	366	i3=tria[i]->vertex[2];
7958e9	367	for(j=1;j<=tlist->n;j++){
SP	368	if(j==i) continue;
41a035	369	j1=tria[j]->vertex[0];
SP	370	j2=tria[j]->vertex[1];
	371	j3=tria[j]->vertex[2];
7958e9	372	if((i1==j1 && i3==j2) \|\| (i1==j2 && i3==j3) \|\| (i1==j3 && i3==j1)){
SP	373	triangle_add_neighbour(tria[i],tria[j]);
	374	nobo++;
	375	}
	376	}
	377	}
	378	for(i=1;i<=tlist->n;i++){
41a035	379	i1=tria[i]->vertex[0];
SP	380	i2=tria[i]->vertex[1];
	381	i3=tria[i]->vertex[2];
7958e9	382	for(j=1;j<=tlist->n;j++){
SP	383	if(j==i) continue;
41a035	384	j1=tria[j]->vertex[0];
SP	385	j2=tria[j]->vertex[1];
	386	j3=tria[j]->vertex[2];
7958e9	387	if((i1==j1 && i2==j3) \|\| (i1==j3 && i2==j2) \|\| (i1==j2 && i2==j1)){
SP	388	triangle_add_neighbour(tria[i],tria[j]);
	389	nobo++;
	390	}
	391	}
	392	}
	393	for(i=1;i<=tlist->n;i++){
41a035	394	i1=tria[i]->vertex[0];
SP	395	i2=tria[i]->vertex[1];
	396	i3=tria[i]->vertex[2];
7958e9	397	for(j=1;j<=tlist->n;j++){
SP	398	if(j==i) continue;
41a035	399	j1=tria[j]->vertex[0];
SP	400	j2=tria[j]->vertex[1];
	401	j3=tria[j]->vertex[2];
7958e9	402	if((i2==j1 && i3==j3) \|\| (i2==j3 && i3==j2) \|\| (i2==j2 && i3==j1)){
SP	403	triangle_add_neighbour(tria[i],tria[j]);
	404	nobo++;
	405	}
	406	}
	407	}
	408	if(nobo != vesicle->blist->n*2) {
	409	ts_fprintf(stderr,"Number of triangles= %u, number of bonds= %u\n",nobo/2, vesicle->blist->n);
	410	fatal("Number of triangle neighbour pairs differs from double the number of bonds!",4);
	411	}
	412	return TS_SUCCESS;
	413	}
	414
	415
	416	ts_bool init_common_vertex_triangle_neighbours(ts_vesicle *vesicle){
	417	ts_uint i,j,jp,k;
	418	ts_vertex k1,k2,k3,k4,*k5;
	419	ts_vertex **vtx=vesicle->vlist->vtx -1; // difference between 0 indexing and 1 indexing
	420	ts_triangle_list *tlist=vesicle->tlist;
	421	ts_triangle **tria=tlist->tria -1;
	422
	423	for(i=1;i<=vesicle->vlist->n;i++){
8f6a69	424	for(j=1;j<=vtx[i]->neigh_no;j++){
SP	425	k1=vtx[i]->neigh[j-1];
7958e9	426	jp=j+1;
8f6a69	427	if(j == vtx[i]->neigh_no) jp=1;
SP	428	k2=vtx[i]->neigh[jp-1];
7958e9	429	for(k=1;k<=tlist->n;k++){ // VERY NON-OPTIMAL!!! too many loops (vlist.n * vtx.neigh * tlist.n )!
41a035	430	k3=tria[k]->vertex[0];
SP	431	k4=tria[k]->vertex[1];
	432	k5=tria[k]->vertex[2];
7958e9	433	// ts_fprintf(stderr,"%u %u: k=(%u %u %u)\n",k1,k2,k3,k4,k5);
SP	434	if((vtx[i]==k3 && k1==k4 && k2==k5) \|\|
	435	(vtx[i]==k4 && k1==k5 && k2==k3) \|\|
	436	(vtx[i]==k5 && k1==k3 && k2==k4)){
b01cc1	437
SP	438	//TODO: probably something wrong with neighbour distribution.
	439	// if(vtx[i]==k3 \|\| vtx[i]==k4 \|\| vtx[i]==k5){
dac2e5	440	// if(i==6) ts_fprintf(stdout, "Vtx[%u] > Added to tristar!\n",i);
7958e9	441	vertex_add_tristar(vtx[i],tria[k]);
SP	442	}
	443	}
	444	}
	445	/* ts_fprintf(stderr,"TRISTAR for %u (%u):",i-1,vtx[i].tristar_no);
	446	for(j=0;j<vtx[i].tristar_no;j++){
	447	ts_fprintf(stderr," %u,",vtx[i].tristar[j]->idx);
	448	}
	449	ts_fprintf(stderr,"\n"); */
	450	}
	451	return TS_SUCCESS;
	452	}
	453
	454
	455	ts_bool init_normal_vectors(ts_triangle_list *tlist){
	456	/* Normals point INSIDE vesicle */
	457	ts_uint k;
	458	ts_triangle **tria=tlist->tria -1; //for 0 indexing
	459	for(k=1;k<=tlist->n;k++){
	460	triangle_normal_vector(tria[k]);
	461	}
	462	return TS_SUCCESS;
	463	}