From 0af0cf6ac748ba9c135c9ca0a23cdd6cbf50caf1 Mon Sep 17 00:00:00 2001
From: Samo Penic <samo.penic@gmail.com>
Date: Fri, 13 Jun 2014 10:27:19 +0000
Subject: [PATCH] First attempt to calculate points of cross-section
---
src/cross-section.h | 5 ++
src/cross-section.c | 43 +++++++++++++++++++++
src/coord.h | 6 +++
src/general.h | 6 +++
src/coord.c | 40 ++++++++++++++++++++
5 files changed, 100 insertions(+), 0 deletions(-)
diff --git a/src/coord.c b/src/coord.c
new file mode 100644
index 0000000..a5723a8
--- /dev/null
+++ b/src/coord.c
@@ -0,0 +1,40 @@
+#include<general.h>
+
+
+
+ts_coord_list *init_coord_list(){
+ ts_coord_list *coordlist=(ts_coord_list *)calloc(1,sizeof(ts_coord_list));
+ if(coordlist==NULL){
+ fatal("Cannot allocate memory for coordlist",999);
+ }
+ return coordlist;
+}
+
+ts_coord_list add_coord(ts_coord_list *coordlist, ts_double e1, ts_double e2, ts_double e3, ts_uint coord_type){
+
+ coordlist->N++;
+ coordlist->coord=(ts_coord *)realloc(coordlist->coord,N*sizeof(ts_coord));
+
+ if(coordlist->coord==NULL){
+ fatal("Cannot allocate memory for coord in coordlist",998);
+ }
+
+ coordlist->coord[coordlist->N-1]->e1=e1;
+ coordlist->coord[coordlist->N-1]->e2=e2;
+ coordlist->coord[coordlist->N-1]->e3=e3;
+ coordlist->coord[coordlist->N-1]->coord_type=coord_type;
+
+}
+
+ts_bool coord_list_free(ts_coord_list coordlist){
+ ts_uint i;
+ if(coordlist==NULL) return TS_SUCCESS;
+ for(i=0; i<coordlist->N;i++){
+ if(coordlist->coord[N]!=NULL) free(coordlist->coord[N]);
+ }
+
+ free(coordlist);
+ return TS_SUCCESS;
+
+
+}
diff --git a/src/coord.h b/src/coord.h
new file mode 100644
index 0000000..a2ddf66
--- /dev/null
+++ b/src/coord.h
@@ -0,0 +1,6 @@
+#ifndef _H_COORD
+#define _H_COORD
+ts_coord_list *init_coord_list();
+ts_coord_list add_coord(ts_coord_list *coordlist, ts_double e1, ts_double e2, ts_double e3, ts_uint coord_type);
+ts_bool coord_list_free(ts_coord_list coordlist);
+#endif
diff --git a/src/cross-section.c b/src/cross-section.c
new file mode 100644
index 0000000..beb00aa
--- /dev/null
+++ b/src/cross-section.c
@@ -0,0 +1,43 @@
+#include<general.h>
+#include<cross-section.h>
+#include<coord.h>
+
+/** @brief Calculates cross-section of vesicle with plane.
+ *
+ * Function returns points of cross-section of vesicle with plane. Plane is described with equation $ax+by+cz+d=0$. Algorithm extracts coordinates of each vertex of a vesicle and then:
+ *
+ * if a distance of point to plane (given by equation $D=\frac{ax_0+by_0+cz_0+d}{\sqrt{a^2+b^2+c^2}}$, where $x_0$, $y_0$ and $z_0$ are coordinates of a given vertex) is less than maximal allowed distance between vertices {\tt sqrt(vesicle->dmax)} than vertex is a candidate for crossection calculation.
+ *
+ */
+ts_coord_list get_crossection_with_plane(ts_vesicle vesicle,ts_double a,ts_double b,ts_double c, ts_double d){
+
+
+ ts_uint i, j, k;
+ ts_double pp,Dsq; // distance from the plane squared
+ ts_double ppn,Dsqn; // distance from the plane squared of a neighbor
+ ts_double u; //factor to scale vector from first vector to the second to get intersection
+ ts_vertex *vtx;
+
+ ts_coord_list *pts=init_coord_list();
+ for(i=0;i<vesicle->vlist->N;i++){
+ vtx=vesicle->vlist->vtx[i];
+
+ pp=vtx->x*a+vtx->y*b+vtx->z*c+d;
+ Dsq=pp*pp/(a*a+b*b+c*c);
+ if(Dsq<vesicle->dmax){
+ for(j=0;j<vtx->neigh_no;j++){
+ ppn=vtx->neigh[j]->x*a+vtx->neigh[j]->y*b+vtx->neigh[j]->z*c+d;
+ if(pp*ppn<0){ //the combination of vertices are good candidates for a crossection
+ u=pp/(a*(vtx->x-vtx->neigh[j]->x)+b*(vtx->y-vtx->neigh[j]->y)+c(vtx->z-vtx->neigh[j]->z));
+ add_coord(pts, vtx->x+u(vtx->neigh[j]->x - vtx->x),
+ vtx->y+u(vtx->neigh[j]->y - vtx->y),
+ vtx->z+u(vtx->neigh[j]->z - vtx->z),
+ TS_COORD_CARTESIAN);
+ }
+ }
+ }
+ }
+ return pts;
+}
+
+
diff --git a/src/cross-section.h b/src/cross-section.h
new file mode 100644
index 0000000..6aa3f6b
--- /dev/null
+++ b/src/cross-section.h
@@ -0,0 +1,5 @@
+#ifndef _H_CROSS_SECTION
+#define _H_CROSS_SECTION
+
+#endif
+
diff --git a/src/general.h b/src/general.h
index 3238245..ef57b1e 100644
--- a/src/general.h
+++ b/src/general.h
@@ -128,6 +128,12 @@
ts_uint coord_type;
} ts_coord;
+
+typedef struct {
+ ts_double N;
+ ts_coord *coord;
+} ts_coord_list;
+
/** @brief Data structure of all data connected to a vertex
*
* ts_vertex holds the data for one single point (bead, vertex). To understand how to use it
--
Gitblit v1.9.3