trisurf-ng.git - Gitblit

Tape is in the dump and successfully restored.

Samo Penic

2016-02-29 698ae18f535c3e388b6ebcdca1582005a29ff2f2

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