#ifndef SUMA_MACROSm_INCLUDED
#define SUMA_MACROSm_INCLUDED
#ifdef isfinite
# define SUMA_IS_GOOD_FLOAT(x) isfinite(x) /* stolen from Bob's thd_floatscan.c */
#else
# define SUMA_IS_GOOD_FLOAT(x) finite(x)
#endif
/*! sqrt(2 pi) and 1/sqrt(2 pi) */
#define SQ_2PI 2.50662827463100024161
#define iSQ_2PI 0.39894228040143270286
/*!
Macro to create a new ID code at random (when strn = NULL) or a hash of a string
written mostly to allow for the allocation of newcode with SUMA's functions
*/
#define SUMA_NEW_ID(newcode, strn) { \
if ((newcode)) { SUMA_S_Err("newcode pointer must be null"); } \
else if (!(strn)) { (newcode) = (char*)SUMA_calloc(SUMA_IDCODE_LENGTH, sizeof(char)); UNIQ_idcode_fill((newcode)); } \
else { char *m_tmp; m_tmp = UNIQ_hashcode((strn)); (newcode) = SUMA_copy_string(m_tmp); free(m_tmp); m_tmp = NULL; } \
}
#define SUMA_WHAT_ENDIAN(End){ \
int m_one = 1; \
/* From RickR's Imon */ \
End = (*(char *)&m_one == 1) ? LSB_FIRST : MSB_FIRST; \
}
#define SUMA_OTHER_ENDIAN(End){ \
End = (End == LSB_FIRST) ? MSB_FIRST : LSB_FIRST; \
}
#define SUMA_SWAP_THIS(nip,chnk){ \
if (chnk == 4) SUMA_swap_4( nip ) ; \
else if (chnk == 8) SUMA_swap_8( nip ) ; \
else if (chnk == 2) SUMA_swap_2( nip ) ; \
else { SUMA_SL_Err ("No swapping performed.") } \
}
/*!
\brief a macro for reading one number at a time from a file
\param nip (void *) where values go
\param fp (FILE *)
\param ex (int) value returned by fread
\param chnk (int) sizeof(TYPE_YOU_READ)
\sa SUMA_READ_NUM_BS
*/
#define SUMA_READ_NUM(nip, fp, ex, chnk) \
{ \
ex = fread (nip, chnk, 1, fp); \
}
/*!
SUMA_READ_NUM with swapping
*/
#define SUMA_READ_NUM_BS(nip, fp, ex, chnk) \
{ \
SUMA_READ_NUM(nip, fp, ex, chnk); \
if (chnk == 4) SUMA_swap_4( nip ) ; \
else if (chnk == 8) SUMA_swap_8( nip ) ; \
else if (chnk == 2) SUMA_swap_2( nip ) ; \
else { SUMA_SL_Err ("No swapping performed.") } \
}
/*!
\brief a macro for reading one integer from a file pointer.
\param nip (int *)
\param bs (int) 0: no swap, 1 swap
\param fp (FILE *)
\param ex (int) value returned by fread
*/
#define SUMA_READ_INT(nip, bs, fp, ex) \
{ static int m_chnk = sizeof(int);\
ex = fread (nip, m_chnk, 1, fp); \
if (bs) { \
if (m_chnk == 4) SUMA_swap_4( nip ) ; \
else if (m_chnk == 8) SUMA_swap_8( nip ) ; \
else if (m_chnk == 2) SUMA_swap_2( nip ) ; /* keep compiler quiet about using swap_2 */ \
else { SUMA_SL_Err ("No swapping performed.") } \
} \
}
#define SUMA_READ_FLOAT(nip, bs, fp, ex) \
{ static int m_chnk = sizeof(float);\
ex = fread (nip, m_chnk, 1, fp); \
if (bs) { \
if (m_chnk == 4) SUMA_swap_4( nip ) ; \
else if (m_chnk == 8) SUMA_swap_8( nip ) ; \
else { SUMA_SL_Err ("No swapping performed.") } \
} \
}
#define SUMA_SWAP_VEC(vec,N_alloc,chnk) {\
int m_i; \
if (chnk == 4) { for (m_i=0; m_i<N_alloc; ++m_i) SUMA_swap_4(&(vec[m_i])); } \
else if (chnk == 2) { for (m_i=0; m_i<N_alloc; ++m_i) SUMA_swap_2(&(vec[m_i])); } \
else if (chnk == 8) { for (m_i=0; m_i<N_alloc; ++m_i) SUMA_swap_8(&(vec[m_i])); } \
else { SUMA_SL_Err("Bad chnk"); } \
}
#define SUMA_CHECK_NULL_STR(str) ((str) ? (str) : "(NULL)")
#define SUMA_IS_STRICT_POS(a) ( ((a) > 0) ? 1 : 0 )
#define SUMA_IS_POS(a) ( ((a) >= 0) ? 1 : 0 )
#define SUMA_IS_STRICT_NEG(a) ( ((a) < 0) ? 1 : 0 )
#define SUMA_IS_NEG(a) ( ((a) <= 0) ? 1 : 0 )
#define SUMA_SIGN(a) ( ((a) < 0) ? -1 : 1 )
#define SUMA_SIGN_CHAR(p) ( ( (p) < 0 ) ? '-' : '+' )
#define SUMA_MIN_PAIR(a,b) ( ((a) <= (b)) ? a : b )
#define SUMA_MAX_PAIR(a,b) ( ((a) <= (b)) ? b : a )
#define SUMA_ABS(a) ( ((a) < 0 ) ? -(a) : a )
#define SUMA_COMPLEX_ADD(a,b,m) { \
(m).r = (a).r+(b).r; \
(m).i = (a).i+(b).i; }
#define SUMA_COMPLEX_REAL_ADD(a,b,m) { \
(m).r = (a).r+(b); \
(m).i = (a).i; }
#define SUMA_COMPLEX_MULT(a,b,m) { \
(m).r = (a).r*(b).r - (a).i*(b).i; \
(m).i = (a).i*(b).r + (a).r*(b).i; }
#define SUMA_COMPLEX_SCALE(a,f,m) {\
(m).r = (a).r*(f); \
(m).i = (a).i*(f); }
#define SUMA_COMPLEX_S2(a) ((a).r*(a).r+(a).i*(a).i)
#define SUMA_COMPLEX_ABS(a) sqrt(SUMA_COMPLEX_S2(a))
#define SUMA_COMPLEX_INV(a,ai) { \
double m_a=SUMA_COMPLEX_S2(a); \
ai.r = a.r/m_a; ai.i = -a.i/m_a; \
}
#define SUMA_POW2(a) ((a)*(a))
#define SUMA_POW3(a) ((a)*(a)*(a))
#define SUMA_R2D(a) ( (a)*180.0/SUMA_PI )
#define SUMA_ROUND(a) ( ( ((a) - (int)(a)) < 0.5 ) ? (int)(a) : ((int)(a)+1) )
#define SUMA_CEIL(a) ( ( ((a) - (int)(a)) == 0.0 ) ? (int)(a) : ((int)(a)+1) )
#define SUMA_3D_2_1D_index(i, j, k, ni, nij) ( (int)(i) + (int)(j) * (ni) + (int)(k) * (nij) )
#define SUMA_1D_2_3D_index(ijk, i, j, k, ni, nij){ \
k = ((ijk) / (nij)); \
j = ((ijk) % (nij)); \
i = ((j) % (ni)); \
j = ((j) / (ni)); \
}
/*!
\brief Returns the two points that are at a distance d from P1 along the direction of U
SUMA_POINT_AT_DISTANCE(U, P1, d, P2)
Input paramters :
\param U (float *) 3x1 vector specifying directions along x, y, z axis
U does not have to be normalized
\param P1 (float *) 3x1 vector containing the XYZ of P1
\param d (float) distance from P1
\param P2 (float 2x3) 2D array to hold the two points equidistant from P1
along U (first row) and -U (second row).
I recommend you initialize P2 to all zeros.
\sa SUMA_POINT_AT_DISTANCE_NORM
{
float P1[3] = { 54.255009, 85.570129, -4.534704 };
float Un[3] = { -0.525731, -0.850651, 0.000000 };
float U[3] = { -2.6287 , -4.2533 , 0 };
float d = 25, P2[2][3];
SUMA_POINT_AT_DISTANCE(U, P1, d, P2);
fprintf(SUMA_STDERR,"P2 [%f %f %f]\n [%f %f %f]\n", P2[0][0], P2[0][1], P2[0][2], P2[1][0], P2[1][1], P2[1][2]);
SUMA_POINT_AT_DISTANCE_NORM(Un, P1, d, P2); use this macro if you have a normalized direction vector ...
fprintf(SUMA_STDERR,"P2 [%f %f %f]\n [%f %f %f]\n", P2[0][0], P2[0][1], P2[0][2], P2[1][0], P2[1][1], P2[1][2]);
}
*/
#define SUMA_POINT_AT_DISTANCE(U, P1, d, P2){ \
float m_n, m_Un[3]; \
SUMA_NORM_VEC(U, 3, m_n); \
if (m_n) { \
if (m_n != 1) { \
m_Un[0] = (U[0]) / (m_n); m_Un[1] = (U[1]) / (m_n); m_Un[2] = (U[2]) / (m_n); \
SUMA_POINT_AT_DISTANCE_NORM(m_Un, P1, d, P2); \
} else { SUMA_POINT_AT_DISTANCE_NORM(U, P1, d, P2); } \
} \
}
/*!
\brief Returns the two points that are at a distance d from P1 along the direction of U
SUMA_POINT_AT_DISTANCE_NORM(U, P1, d, P2)
Input paramters :
\param U (float *) 3x1 vector specifying directions along x, y, z axis
U MUST BE A UNIT VECTOR
\param P1 (float *) 3x1 vector containing the XYZ of P1
\param d (float) distance from P1
\param P2 (float 2x3) 2D array to hold the two points equidistant from P1
along U (first row) and -U (second row).
I recommend you initialize P2 to all zeros.
\sa SUMA_POINT_AT_DISTANCE
{
float P1[3] = { 54.255009, 85.570129, -4.534704 };
float Un[3] = { -0.525731, -0.850651, 0.000000 };
float U[3] = { -2.6287 , -4.2533 , 0 };
float d = 25, P2[2][3];
SUMA_POINT_AT_DISTANCE(U, P1, d, P2);
fprintf(SUMA_STDERR,"P2 [%f %f %f]\n [%f %f %f]\n", P2[0][0], P2[0][1], P2[0][2], P2[1][0], P2[1][1], P2[1][2]);
SUMA_POINT_AT_DISTANCE_NORM(Un, P1, d, P2); use this macro if you have a normalized direction vector ...
fprintf(SUMA_STDERR,"P2 [%f %f %f]\n [%f %f %f]\n", P2[0][0], P2[0][1], P2[0][2], P2[1][0], P2[1][1], P2[1][2]);
}
*/
#define SUMA_POINT_AT_DISTANCE_NORM(U, P1, d, P2){ \
P2[0][0] = (d) * U[0]; P2[1][0] = -(d) * U[0]; P2[0][0] += P1[0]; P2[1][0] += P1[0]; \
P2[0][1] = (d) * U[1]; P2[1][1] = -(d) * U[1]; P2[0][1] += P1[1]; P2[1][1] += P1[1]; \
P2[0][2] = (d) * U[2]; P2[1][2] = -(d) * U[2]; P2[0][2] += P1[2]; P2[1][2] += P1[2]; \
}
/*!
\brief SUMA_FROM_BARYCENTRIC(u, v, p1, p2, p3, p)
change from barycentric coordinates.
*/
#define SUMA_FROM_BARYCENTRIC(u, v, p1, p2, p3, p){ \
(p)[0] = (p1)[0] + (u) * ((p2)[0] - (p1)[0] ) + (v) * ((p3)[0] - (p1)[0]); \
(p)[1] = (p1)[1] + (u) * ((p2)[1] - (p1)[1] ) + (v) * ((p3)[1] - (p1)[1]); \
(p)[2] = (p1)[2] + (u) * ((p2)[2] - (p1)[2] ) + (v) * ((p3)[2] - (p1)[2]); \
}
/*!
\brief calculate spherical coordinates from cartesian.
Assuming coords are centered on 0 0 0.
c XYZ coordinates in cartesian
s rtp Rho, theta (azimuth), phi (elevation) in spherical
\sa SUMA_Cart2Sph
\sa SUMA_SPH_2_CART
*/
#define SUMA_CART_2_SPH(c,s){\
SUMA_NORM_VEC(c, 3, s[0]); \
s[1] = atan2(c[1], c[0]); /* theta (azimuth) */ \
s[2] = atan2(c[2],sqrt(c[0]*c[0]+c[1]*c[1])); /* phi (elevation)*/ \
}
/*!
\brief calculate cartesian coordinates from spherical.
Assuming coords are centered on 0 0 0.
s rtp Rho, theta (azimuth), phi (elevation) in spherical
c XYZ coordinates in cartesian
\sa SUMA_CART_2_SPH
*/
#define SUMA_SPH_2_CART(s,c){\
c[0] = s[0] * cos(s[2]) * cos(s[1]) ; \
c[1] = s[0] * cos(s[2]) * sin(s[1]) ; \
c[2] = s[0] * sin(s[2]); \
}
/* largest absolute value */
#define SUMA_LARG_ABS(a, b) ( ( fabs((double)(a)) > fabs((double)(b)) ) ? fabs((double)(a)) : fabs((double)(b)) )
/*! the 1D index of element
[r][c] in a row major matrix
of nc columns */
#define SRM(r,c,nc) ((nc)*(r)+(c))
/*! the 1D index of element
[r][c] in a column major matrix
of nr rows */
#define SCM(r,c,nr) ((r)+(nr)*(c))
#define SUMA_WRAP_VALUE(v, min, max) \
{ \
if (v > max) v = min; \
else if (v < min) v = max; \
}
#define SUMA_CLIP_VALUE(v, min, max) \
{ \
if (v > max) v = max; \
else if (v < min) v = min; \
}
#define SUMA_CLIP_UB(v, max) \
{ \
if (v > max) v = max; \
}
#define SUMA_CLIP_LB(v, min) \
{ \
if (v < min) v = min; \
}
/*! determines the distance and side of the plane that a point is located
see also SUMA_Surf_Plane_Intersect
if Dist = 0, point on plane, if Dist > 0 point above plane (along normal), if Dist < 0 point is below plane
*/
#define SUMA_DIST_FROM_PLANE(P1, P2, P3, P, Dist){ \
static float m_Eq[4]; \
SUMA_Plane_Equation ( P1, P2, P3, m_Eq); \
Dist = m_Eq[0] * P[0] + m_Eq[1] * P[1] + m_Eq[2] * P[2] + m_Eq[3] ; \
}
/*!
Equation of a plane given its normal and a point
See also SUMA_Plane_Equation
*/
#define SUMA_PLANE_NORMAL_POINT(N, P, Eq) { \
Eq[0] = N[0]; Eq[1] = N[1]; Eq[2] = N[2]; \
Eq[3] = -(Eq[0]*P[0] + Eq[1]*P[1] + Eq[2]*P[2]); \
}
/*!
determines the bounding box for a triangle
*/
#define SUMA_TRIANGLE_BOUNDING_BOX(n1, n2, n3, min_v, max_v){ \
min_v[0] = SUMA_MIN_PAIR( (n1)[0], (n2)[0]); min_v[0] = SUMA_MIN_PAIR( (n3)[0], min_v[0]); \
min_v[1] = SUMA_MIN_PAIR( (n1)[1], (n2)[1]); min_v[1] = SUMA_MIN_PAIR( (n3)[1], min_v[1]); \
min_v[2] = SUMA_MIN_PAIR( (n1)[2], (n2)[2]); min_v[2] = SUMA_MIN_PAIR( (n3)[2], min_v[2]); \
max_v[0] = SUMA_MAX_PAIR( (n1)[0], (n2)[0]); max_v[0] = SUMA_MAX_PAIR( (n3)[0], max_v[0]); \
max_v[1] = SUMA_MAX_PAIR( (n1)[1], (n2)[1]); max_v[1] = SUMA_MAX_PAIR( (n3)[1], max_v[1]); \
max_v[2] = SUMA_MAX_PAIR( (n1)[2], (n2)[2]); max_v[2] = SUMA_MAX_PAIR( (n3)[2], max_v[2]); \
}
/*!
\brief find out if a point p on the line formed by points p0 and p1 is between p0 and p1
ans = SUMA_IS_POINT_IN_SEGMENT(p, p0, p1);
if ans then p is between p0 and p1
p, p0, p1 (float *) xyz of points
- NOTE: macro does not check that three points are colinear (as they should be)!
*/
#define SUMA_IS_POINT_IN_SEGMENT(p, p0, p1) ( ( ( \
(p[0] > p0[0] && p[0] < p1[0]) || \
(p[0] < p0[0] && p[0] > p1[0]) || \
(SUMA_ABS(p[0] - p0[0]) < 0.00000001 || \
SUMA_ABS(p[0] - p1[0]) < 0.00000001 ) \
)\
&& \
( \
(p[1] > p0[1] && p[1] < p1[1]) || \
(p[1] < p0[1] && p[1] > p1[1]) || \
(SUMA_ABS(p[1] - p0[1]) < 0.00000001 || \
SUMA_ABS(p[1] - p1[1]) < 0.00000001 ) \
)\
&& \
( \
(p[2] > p0[2] && p[2] < p1[2]) || \
(p[2] < p0[2] && p[2] > p1[2]) || \
(SUMA_ABS(p[2] - p0[2]) < 0.00000001 || \
SUMA_ABS(p[2] - p1[2]) < 0.00000001 ) \
)\
) ? 1 : 0 )
/*!
\brief Intersection of a segment with a plane
\param p1 x y z of point 1
\param p2 x y z of point 2
\param Eq equation of plane
\param Hit: On exit: 1 segment interects plane
0 segment does not intersect plane
\param pinter: On exit: x y z of intersection point (0,0,0) if no intersection
Note: Macro is not efficient to use when intersection if between entire surface
and plane. For that use SUMA_Surf_Plane_Intersect
*/
#define SUMA_SEGMENT_PLANE_INTERSECT(p1, p2, Eq, Hit, pinter) { \
double m_p1, m_p2, m_u; \
m_p1 = Eq[0] * p1[0] + Eq[1] * p1[1] + Eq[2] * p1[2] + Eq[3]; \
m_p2 = Eq[0] * p2[0] + Eq[1] * p2[1] + Eq[2] * p2[2] + Eq[3]; \
/* fprintf(SUMA_STDERR,"m_p1=%f, m_p2 = %f\n", m_p1, m_p2); */\
if ((SUMA_SIGN(m_p1)) != (SUMA_SIGN(m_p2)) ) { \
Hit = 1; \
m_u = -m_p1 / (m_p2 - m_p1); \
pinter[0] = p1[0] + m_u * ( p2[0] - p1[0] ); \
pinter[1] = p1[1] + m_u * ( p2[1] - p1[1] ); \
pinter[2] = p1[2] + m_u * ( p2[2] - p1[2] ); \
} else { \
Hit = 0; \
pinter[0] = pinter[1] = pinter[2] = 0.0; \
} \
}
#define SUMA_SET_GL_RENDER_MODE(m_PolyMode) \
{ \
switch (m_PolyMode) { \
case SRM_Fill: \
glPolygonMode(GL_FRONT_AND_BACK, GL_FILL); \
break; \
case SRM_Line: \
glPolygonMode(GL_FRONT_AND_BACK, GL_LINE); \
break; \
case SRM_Points: \
glPolygonMode(GL_FRONT_AND_BACK, GL_POINT); \
break; \
case SRM_ViewerDefault: \
break; \
default: \
fprintf (SUMA_STDERR, "Error %s: Wrong Rendering Mode.\n", FuncName); \
break; \
} \
}
/*!
\brief calculates the average 'radius' of a surface.
avg(dist(node_i,center));
*/
#define SUMA_SO_RADIUS(SO, r){ \
int m_i, m_i3; \
float m_dx, m_dy, m_dz; \
r = 0.0; \
for (m_i=0; m_i<SO->N_Node; ++m_i) { \
m_i3 = 3 * m_i; \
m_dx = SO->NodeList[m_i3 ] - SO->Center[0]; \
m_dy = SO->NodeList[m_i3+1] - SO->Center[1]; \
m_dz = SO->NodeList[m_i3+2] - SO->Center[2]; \
r += sqrt( (m_dx * m_dx) + (m_dy * m_dy) + (m_dz * m_dz)); \
} \
r /= (float)SO->N_Node; \
}
/*!
A macro to calculate a surface object's normals
*/
#define SUMA_RECOMPUTE_NORMALS(SO){ \
SUMA_SURF_NORM m_SN; \
if (SO->NodeNormList) SUMA_free(SO->NodeNormList); SO->NodeNormList = NULL; \
if (SO->FaceNormList) SUMA_free(SO->FaceNormList); SO->FaceNormList = NULL; \
m_SN = SUMA_SurfNorm(SO->NodeList, SO->N_Node, SO->FaceSetList, SO->N_FaceSet ); \
SO->NodeNormList = m_SN.NodeNormList; \
SO->FaceNormList = m_SN.FaceNormList; \
SO->glar_NodeNormList = (GLfloat *) SO->NodeNormList; /* just copy the pointer, not the data */\
SO->glar_FaceNormList = (GLfloat *) SO->FaceNormList; \
}
/*!
Pause prompt, stdin
*/
#define SUMA_PAUSE_PROMPT(s) { int m_jnk; fprintf(SUMA_STDOUT,"Pausing: %s ...", s); fflush(SUMA_STDOUT); m_jnk = getchar(); fprintf(SUMA_STDOUT,"\n"); fflush(SUMA_STDOUT);}
/*!
A macro to recalculate a surface's center and its bounding box
*/
#define SUMA_DIM_CENTER(SO){ \
SUMA_MIN_MAX_SUM_VECMAT_COL (SO->NodeList, SO->N_Node, SO->NodeDim, SO->MinDims, SO->MaxDims, SO->Center); \
SO->Center[0] /= SO->N_Node; \
SO->Center[1] /= SO->N_Node; \
SO->Center[2] /= SO->N_Node; \
SUMA_MIN_VEC (SO->MinDims, 3, SO->aMinDims ); \
SUMA_MAX_VEC (SO->MaxDims, 3, SO->aMaxDims); \
}
/*!
A macro to scale the surface so that the largest bounding box size is SZ
*/
#define SUMA_LARGEST_SIZE_SCALE(SO, SZ){ \
float m_lg , m_lg1 , m_lg2 ; \
double scl = 1.0; \
int m_i_mx, m_i, m_itop; \
m_i_mx = 0; \
m_lg = SO->MaxDims[0] - SO->Center[0]; \
m_lg1 = SO->MaxDims[1] - SO->Center[1], \
m_lg2 = SO->MaxDims[2] - SO->Center[2]; \
m_itop = SO->NodeDim * SO->N_Node; \
if (m_lg < m_lg1) { m_lg = m_lg1; m_i_mx = 1; } \
if (m_lg < m_lg2) { m_lg = m_lg2; m_i_mx = 2; } \
if (m_lg > 0.0) { \
scl = (double)SZ / 2.0 / (double)m_lg; \
for (m_i=0; m_i < m_itop; ++m_i) { SO->NodeList[m_i] = (float)(scl*(double)SO->NodeList[m_i]); } \
for (m_i=0; m_i < 3; ++m_i) { \
SO->MinDims[m_i] = (float)(scl*(double)SO->MinDims[m_i]); \
SO->MaxDims[m_i] = (float)(scl*(double)SO->MaxDims[m_i]); \
} \
SO->aMinDims = (float)(scl*(double)SO->aMinDims); \
SO->aMaxDims = (float)(scl*(double)SO->aMaxDims); \
}\
}
/*! calculate the centroid of a triangular faceset */
#define SUMA_FACE_CENTROID(SO, ifc, c){ \
static int m_n1, m_n2, m_n3; \
m_n1 = SO->FaceSetList[3*ifc]; m_n2 = SO->FaceSetList[3*ifc+1]; m_n3 = SO->FaceSetList[3*ifc+2]; \
c[0] = (SO->NodeList[3*m_n1] + SO->NodeList[3*m_n2] + SO->NodeList[3*m_n3] )/3; \
c[1] = (SO->NodeList[3*m_n1+1] + SO->NodeList[3*m_n2+1] + SO->NodeList[3*m_n3+1])/3; \
c[2] = (SO->NodeList[3*m_n1+2] + SO->NodeList[3*m_n2+2] + SO->NodeList[3*m_n3+2])/3; \
}
/*!
A macro to find the third node forming a triangle
*/
#define SUMA_THIRD_TRIANGLE_NODE(n1,n2,t,facelist,n3){ \
static int m_t3; \
m_t3 = 3 * t; \
n3 = -1; \
do { \
if (facelist[m_t3] != n1 && facelist[m_t3] != n2) n3 = facelist[m_t3]; \
else ++m_t3; \
} while (n3 < 0); \
}
/*!
A macro to find the two other nodes forming a triangle
*/
#define SUMA_TWO_OTHER_TRIANGLE_NODES(n1,t,facelist,n2,n3){ \
static int m_t3; \
m_t3 = 3 * t; \
n2 = n3 = -1; \
if (facelist[m_t3 ] == n1) { \
n2 = facelist[m_t3+1]; \
n3 = facelist[m_t3+2]; \
} else if (facelist[m_t3+1] == n1) { \
n2 = facelist[m_t3 ]; \
n3 = facelist[m_t3+2]; \
} else if (facelist[m_t3+2] == n1) { \
n2 = facelist[m_t3 ]; \
n3 = facelist[m_t3+1]; \
} \
}
/*!
A macro version of SUMA_FindEdge
Use function for robust error checking.
Here you are on your own.
you should make sure n1 < n2
you should initialize iseg to -1 before calling the macro
*/
/* NEW VERSION: Bug found in previous one (_OLD),
it is possible that m_eloc is -1 at initialization: m_eloc = m_EL->ELloc[m_n1];
see below for fix
*/
#define SUMA_FIND_EDGE(m_EL, m_n1, m_n2, m_iseg) \
{ int m_eloc = m_EL->ELloc[m_n1]; \
if (m_eloc >= 0) { /* It is possible that m_n1 has m_EL->ELloc[m_n1] = -1, this happens when m_n1 is surrounded by nodes of lower indices */\
for (m_eloc=m_EL->ELloc[m_n1]; m_eloc<m_EL->N_EL; ++m_eloc) { \
/* fprintf(stderr, "%d/%d\n", m_eloc, m_EL->N_EL); */\
if (m_EL->EL[m_eloc][0] != m_n1) break; \
if (m_EL->EL[m_eloc][1] == m_n2) m_iseg = m_eloc; \
} \
} \
}
#define SUMA_FIND_EDGE_OLD(m_EL, m_n1, m_n2, m_iseg) \
{ int m_eloc ; \
m_eloc = m_EL->ELloc[m_n1]; \
do { \
if (m_EL->EL[m_eloc][1] == m_n2) m_iseg = m_eloc; \
++m_eloc; \
} while (m_EL->EL[m_eloc][0] == m_n1 && m_eloc < m_EL->N_EL); \
}
/*!
Macro that sets Ntail to be the index of the last node of the last ROIdatum in a
DrawnROI. Ntail is -1 if the macro fails
*/
#define SUMA_DRAWN_ROI_TAIL_NODE(D_ROI, Ntail) \
{\
DListElmt *m_Tail=NULL; \
SUMA_ROI_DATUM *m_ROId=NULL; \
Ntail = -1; \
m_Tail = dlist_tail(D_ROI->ROIstrokelist); \
if (m_Tail) { \
m_ROId = (SUMA_ROI_DATUM *)m_Tail->data; \
if (m_ROId->N_n) Ntail = m_ROId->nPath[m_ROId->N_n-1]; \
} \
}
/*!
Macro that sets Nhead to be the index of the 1st node of the 1st ROIdatum in a
DrawnROI. Nhead is -1 if the macro fails
*/
#define SUMA_DRAWN_ROI_HEAD_NODE(D_ROI, Nhead) \
{\
DListElmt *m_Head=NULL; \
SUMA_ROI_DATUM *m_ROId=NULL; \
Nhead = -1; \
m_Head = dlist_head(D_ROI->ROIstrokelist); \
if (m_Head) { \
m_ROId = (SUMA_ROI_DATUM *)m_Head->data; \
if (m_ROId->N_n) Nhead = m_ROId->nPath[0]; \
} \
}
/* definitions for SUMA_MT_intersect */
#define SUMA_MT_CROSS(m_MTCR_dest,m_MTCR_v1,m_MTCR_v2) \
m_MTCR_dest[0]=m_MTCR_v1[1]*m_MTCR_v2[2]-m_MTCR_v1[2]*m_MTCR_v2[1]; \
m_MTCR_dest[1]=m_MTCR_v1[2]*m_MTCR_v2[0]-m_MTCR_v1[0]*m_MTCR_v2[2]; \
m_MTCR_dest[2]=m_MTCR_v1[0]*m_MTCR_v2[1]-m_MTCR_v1[1]*m_MTCR_v2[0];
#define SUMA_MT_DOT(m_MTDOT_v1,m_MTDOT_v2) (m_MTDOT_v1[0]*m_MTDOT_v2[0]+m_MTDOT_v1[1]*m_MTDOT_v2[1]+m_MTDOT_v1[2]*m_MTDOT_v2[2])
#define SUMA_MT_SUB(m_MTSUB_dest,m_MTSUB_v1,m_MTSUB_v2) \
m_MTSUB_dest[0]=m_MTSUB_v1[0]-m_MTSUB_v2[0]; \
m_MTSUB_dest[1]=m_MTSUB_v1[1]-m_MTSUB_v2[1]; \
m_MTSUB_dest[2]=m_MTSUB_v1[2]-m_MTSUB_v2[2];
#define SUMA_NORM(m_NORM_dest, m_NORM_v1) \
m_NORM_dest= sqrt(m_NORM_v1[0]*m_NORM_v1[0]+m_NORM_v1[1]*m_NORM_v1[1]+m_NORM_v1[2]*m_NORM_v1[2]);
#define SUMA_TRI_AREA(m_TRIAREA_n0,m_TRIAREA_n1,m_TRIAREA_n2, m_TRIAREA_A) {\
float m_TRIAREA_dv[3], m_TRIAREA_dw[3], m_TRIAREA_cross[3]; \
SUMA_MT_SUB (m_TRIAREA_dv, m_TRIAREA_n1, m_TRIAREA_n0); \
SUMA_MT_SUB (m_TRIAREA_dw, m_TRIAREA_n2, m_TRIAREA_n0); \
SUMA_MT_CROSS(m_TRIAREA_cross,m_TRIAREA_dv,m_TRIAREA_dw); \
SUMA_NORM(m_TRIAREA_A, m_TRIAREA_cross); \
m_TRIAREA_A *= 0.5; \
}
/*!
XYZ: vector of coordinates
nrm: unit normal vector of axis of rotaion
phi: angle of rotation, counterclockwise, in radians
XYZr: vector to contain rotated coordinates
Equation from: http://mathworld.wolfram.com/RotationFormula.html
Note that this equation subtracts the last term, the cross product.
The website equation adds the last term.
This change permits counterclockwise angle of rotation and the proper axis of rotation.
See also RotateAboutAxis.m
*/
#define SUMA_ROTATE_ABOUT_AXIS(xyz, nrm, phi, xyzr) { \
double m_cop, m_sip, m_dop, m_cro[3], m_1cop; \
m_cop = cos(phi); m_1cop = 1 - m_cop; m_sip = sin(phi); \
SUMA_MT_CROSS(m_cro, xyz, nrm); \
m_dop = SUMA_MT_DOT(nrm,xyz); \
xyzr[0] = xyz[0]*m_cop + nrm[0] * m_dop * m_1cop - m_cro[0] * m_sip; \
xyzr[1] = xyz[1]*m_cop + nrm[1] * m_dop * m_1cop - m_cro[1] * m_sip; \
xyzr[2] = xyz[2]*m_cop + nrm[2] * m_dop * m_1cop - m_cro[2] * m_sip; \
}
/*!
SUMA_3D_Rotation_Matrix(P1, P2, M, alpha, nrm)
Generate the rotation matrix for moving from P1 to P2.
For rotation about a specified origin and direction.
Rotation through angle alpha about an axis m_u. Alpha is always positive and counterclockwise.
P1, P2: intial and final vector location
m_alpha: angle between P1 and P2
m_u: axis of rotation and cross product of P1, P2
mn_u: magnitude of axis of rotation needed to normalize the axis of rotation
m_M: 3x3 rotation matrix
Equations based on matlab script AxisRotate3D.m
*/
#define SUMA_3D_Rotation_Matrix(P1, P2, M, m_alpha, m_u) { \
static double m_x, m_y, m_z, m_mag_u; \
static double m_xy_vera, m_xz_vera, m_yz_vera; \
static double m_cosa, m_sina, m_vera; \
SUMA_ANGLE_DIST_NC(P2 , P1, m_alpha, m_u); \
m_mag_u = sqrt( m_u[0]*m_u[0] + m_u[1]*m_u[1] + m_u[2]*m_u[2] ); \
if( m_mag_u > 0.000000001 ) { m_u[0] = m_u[0]/m_mag_u ; m_u[1] = m_u[1]/m_mag_u ; m_u[2] = m_u[2]/m_mag_u ;}; \
m_x = m_u[0]; m_y = m_u[1]; m_z = m_u[2]; \
m_cosa = cos(m_alpha); m_sina = sin(m_alpha); m_vera = 1 - m_cosa; \
m_xy_vera = m_x * m_y * m_vera; m_xz_vera = m_x * m_z * m_vera; m_yz_vera = m_y * m_z * m_vera;\
\
M[0][0] = m_cosa + m_x * m_x * m_vera; \
M[0][1] = m_xy_vera - m_z * m_sina; \
M[0][2] = m_xz_vera + m_y * m_sina; \
M[1][0] = m_xy_vera + m_z * m_sina; \
M[1][1] = m_cosa + m_y * m_y * m_vera; \
M[1][2] = m_yz_vera - m_x * m_sina; \
M[2][0] = m_xz_vera - m_y*m_sina; \
M[2][1] = m_yz_vera + m_x*m_sina; \
M[2][2] = m_cosa + m_z * m_z * m_vera; \
}
/*!
SUMA_ANGLE_DIST(p2,p1,cent,a,nrm)
SUMA_ANGLE_DIST_NC(p2,p1,a, nrm)
calculate angular distance between two points
on a sphere.
For the _NC version, the sphere is centered on
0 0 0 and has a radius of 1
p1 and p2 are the XYZ of the two points
cent is the center of the sphere
and 'a' is the angle in radians between them.
m_cr contains the cross product p1 cross p2
Tx to tip from JHU's Applied Physics Laboratory web page
*/
#define SUMA_ANGLE_DIST_NC(m_p2,m_p1,a, m_cr) \
{\
double m_p2r[3]; \
static double m_mag; \
SUMA_MT_CROSS(m_cr, m_p1, m_p2); \
a = atan2(sqrt(m_cr[0]*m_cr[0]+m_cr[1]*m_cr[1]+m_cr[2]*m_cr[2]),SUMA_MT_DOT(m_p2, m_p1)); \
}
#define SUMA_ANGLE_DIST(p2,p1,cent,a,m_cr) \
{\
double m_p1[3],m_p2[3],m_np1, m_np2; \
SUMA_MT_SUB(m_p1, p1, cent); SUMA_NORM(m_np1, m_p1); if (m_np1) { m_p1[0] /= m_np1; m_p1[1] /= m_np1; m_p1[2] /= m_np1; }\
SUMA_MT_SUB(m_p2, p2, cent); SUMA_NORM(m_np2, m_p2); if (m_np2) { m_p2[0] /= m_np2; m_p2[1] /= m_np2; m_p2[2] /= m_np2; }\
SUMA_MT_CROSS(m_cr, m_p2, m_p1); \
a = atan2(sqrt(m_cr[0]*m_cr[0]+m_cr[1]*m_cr[1]+m_cr[2]*m_cr[2]),SUMA_MT_DOT(m_p2, m_p1)); \
}
/*!
SUMA_SINC(alpha)
calculate the sinc function.
alpha is an angle in radians
sinc is the value of the function at alpha
*/
#define SUMA_SINC(alpha, sinc) \
{\
if( alpha < 0.0000001 ) { sinc = 1.0; } \
else { sinc = sin(alpha) / alpha ; } \
}
/*!
\brief SUMA_EULER_SO (SO, eu)
computes the euler number = N - E + F
eu = SO->N_Node - SO->EL->N_Distinct_Edges + SO->N_FaceSet
eu = 2 for closed surfaces
-1000 --> NULL SO
-1001 --> NULL SO->EL
*/
#define SUMA_EULER_SO(SO, eu) { \
if (!SO) { eu = -1000; } \
else if (!SO->EL) { eu = -1001; } \
else eu = SO->N_Node - SO->EL->N_Distinct_Edges + SO->N_FaceSet; \
}
/*!
\brief SUMA_IS_IN_VEC(vec, nel, val, loc);
\param vec pointer to vector of at least nel elements
\param nel (int) number of elements to check in vec
\param val value to look for in vec
\param loc (int) index in vec where val was found. -1 if nothing was found
*/
#define SUMA_IS_IN_VEC(m_vec, m_nel, m_val, m_loc) { \
int m_i=0;\
m_loc = -1;\
while (m_i < m_nel) { \
if (m_vec[m_i] == m_val) { \
m_loc = m_i; \
m_i = m_nel; \
} else { \
++ m_i; \
} \
} \
}
#define SUMA_DBG_IN_NOTIFY(m_fname) { \
int m_i;\
++SUMAg_CF->InOut_Level; \
for (m_i=0; m_i < SUMAg_CF->InOut_Level; ++m_i) fprintf (SUMA_STDERR," ");\
fprintf (SUMA_STDERR,"--dbg: Entered %s (lvl %d).\n", m_fname, SUMAg_CF->InOut_Level); \
}
#define SUMA_DBG_OUT_NOTIFY(m_fname) { \
int m_i;\
for (m_i=0; m_i < SUMAg_CF->InOut_Level; ++m_i) fprintf (SUMA_STDERR," ");\
fprintf (SUMA_STDERR,"--dbg: Left %s (lvl %d).\n", m_fname, SUMAg_CF->InOut_Level); \
--SUMAg_CF->InOut_Level; \
}
/*! \def SUMA_REPORT_WICH_WIDGET_SV(m_w)
\brief SUMA_REPORT_WICH_WIDGET_SV macro for determining what type of widget m_w is and which sv it belongs to
*/
#define SUMA_REPORT_WICH_WIDGET_SV(m_w) {\
int m_i = 0; \
SUMA_SurfaceViewer *m_sv = NULL; \
int m_svi = -1; \
while (m_i < SUMA_MAX_SURF_VIEWERS) { \
/* the series of if statements should be else-ifs but I left them like that for debugging purposes */ \
if (SUMAg_SVv[m_i].X->GLXAREA == m_w) { \
fprintf (SUMA_STDERR,"SUMA_REPORT_WICH_WIDGET_SV: %p is GLXAREA widget in Surface Viewer %d.\n", m_w, m_i); \
m_svi = m_i; \
} \
if (SUMAg_SVv[m_i].X->TOPLEVEL == m_w) { \
fprintf (SUMA_STDERR,"SUMA_REPORT_WICH_WIDGET_SV: %p is TOPLEVEL widget in Surface Viewer %d.\n", m_w, m_i); \
m_svi = m_i; \
} \
if (SUMAg_SVv[m_i].X->FORM == m_w) { \
fprintf (SUMA_STDERR,"SUMA_REPORT_WICH_WIDGET_SV: %p is FORM widget in Surface Viewer %d.\n", m_w, m_i); \
m_svi = m_i; \
} \
if (SUMAg_SVv[m_i].X->FRAME == m_w) { \
fprintf (SUMA_STDERR,"SUMA_REPORT_WICH_WIDGET_SV: %p is FRAME widget in Surface Viewer %d.\n", m_w, m_i); \
m_svi = m_i; \
} \
++m_i; \
} \
}
/*! \def SUMA_ANY_WIDGET2SV(m_w, m_sv, m_svi)
\brief SUMA_ANY_WIDGET2SV macro for determining the SurfaceViewer structure containing any of the following widgets: GLXAREA, TOPLEVEL, FORM, FRAME. The macro searches all the SurfaceViewer structures in SUMAg_SVv.
m_w the widget in question
m_sv a pointer to SUMA_SurfaceViewer structure. This pointer is NULL if no matching SurfaceViewer structure is found in SUMAg_SVv
m_svi the index of m_sv in SUMAg_SVv vector of Surface Viewer structures. m_sv = &(SUMAg_SVv[m_svi]). -1 if no match was found
*/
#define SUMA_ANY_WIDGET2SV(m_w, m_sv, m_svi) {\
int m_i = 0; \
m_sv = NULL; \
m_svi = -1; \
while (m_i < SUMA_MAX_SURF_VIEWERS) { \
if (SUMAg_SVv[m_i].X->GLXAREA == m_w || SUMAg_SVv[m_i].X->TOPLEVEL == m_w || SUMAg_SVv[m_i].X->FORM == m_w || SUMAg_SVv[m_i].X->FRAME == m_w) { \
m_svi = m_i; \
m_sv = &(SUMAg_SVv[m_i]); \
m_i = SUMA_MAX_SURF_VIEWERS; \
} else { \
++m_i; \
} \
} \
}
/*! \def SUMA_GLXAREA_WIDGET2SV(m_w, m_sv, m_svi)
\brief SUMA_GLXAREA_WIDGET2SV macro for determining the SurfaceViewer structure containing the widget: GLXAREA. The macro searches all the SurfaceViewer structures in SUMAg_SVv.
m_w the widget in question
m_sv a pointer to SUMA_SurfaceViewer structure. This pointer is NULL if no matching SurfaceViewer structure is found in SUMAg_SVv
m_svi the index of m_sv in SUMAg_SVv vector of Surface Viewer structures. m_sv = &(SUMAg_SVv[m_svi]). -1 if no match was found
*/
#define SUMA_GLXAREA_WIDGET2SV(m_w, m_sv, m_svi) {\
int m_i = 0; \
m_sv = NULL; \
m_svi = -1; \
while (m_i < SUMA_MAX_SURF_VIEWERS) { \
if (SUMAg_SVv[m_i].X->GLXAREA == m_w) { \
m_svi = m_i; \
m_sv = &(SUMAg_SVv[m_i]); \
m_i = SUMA_MAX_SURF_VIEWERS; \
} else { \
++m_i; \
} \
} \
}
/*!
Find the closest node in SO to coordinate xyz
distance^2 is stored in d and nc is the index of the
the closest node
*/
#define SUMA_CLOSEST_NODE(SO, xyz, nc, d) { \
double m_dxyz = 1023734552736672366372.0; \
float *m_p; \
int m_n=0; \
nc = -1; \
for (m_n=0; m_n<SO->N_Node; ++m_n) { \
m_p = &(SO->NodeList[SO->NodeDim*m_n]); \
SUMA_SEG_LENGTH_SQ(m_p, xyz, d); \
if (d < m_dxyz) { \
m_dxyz = d; nc = m_n; \
} \
} \
}
/* Many of these macros are taken from DSP_in_C examples in
C Language Algorithms for Digital Signal Processing
by
Bruce Kimball, Paul Embree and Bruce Kimble
1991, Prentice Hall
*/
/*! \def SUMA_SEG_LENGTH(a,b, dist)
\brief SUMA_SEG_LENGTH macro for a segment's length
a pointer to xyz coordinates
b pointer to xyz coordinates
dist (float) sqrt( (m_b[0] - m_a[0]) * (m_b[0] - m_a[0])
+(m_b[1] - m_a[1]) * (m_b[1] - m_a[1])
+(m_b[2] - m_a[2]) * (m_b[2] - m_a[2]) );
*/
#define SUMA_SEG_LENGTH(m_a, m_b, m_dist) { \
m_dist = sqrt( (m_b[0] - m_a[0]) * (m_b[0] - m_a[0]) \
+(m_b[1] - m_a[1]) * (m_b[1] - m_a[1]) \
+(m_b[2] - m_a[2]) * (m_b[2] - m_a[2]) ); \
}
/*! \def SUMA_SEG_LENGTH_SQ(a,b, dist)
\brief SUMA_SEG_LENGTH_SQ macro for a segment's squared length
a pointer to xyz coordinates
b pointer to xyz coordinates
dist (float) ( (m_b[0] - m_a[0]) * (m_b[0] - m_a[0])
+(m_b[1] - m_a[1]) * (m_b[1] - m_a[1])
+(m_b[2] - m_a[2]) * (m_b[2] - m_a[2]) );
*/
#define SUMA_SEG_LENGTH_SQ(m_a, m_b, m_dist) { \
m_dist = (m_b[0] - m_a[0]) * (m_b[0] - m_a[0]) \
+(m_b[1] - m_a[1]) * (m_b[1] - m_a[1]) \
+(m_b[2] - m_a[2]) * (m_b[2] - m_a[2]) ; \
}
/*! \def SUMA_NORM_VEC(a,nel, norm)
\brief SUMA_NORM_VEC macro for vectors's norm (sqrt of sum of squares)
a pointer to vector
nel number of elements in vector
norm (float) norm of a
*/
#define SUMA_NORM_VEC(a,nel,norm) { \
int m_I; \
norm = 0.0; \
for (m_I = 0; m_I < nel; m_I++) { \
norm += a[m_I]*a[m_I]; \
} \
norm = sqrt(norm); \
}
/*! \def SUMA_MIN_VEC(a,nel, amin)
\brief SUMA_MIN_VEC macro for minimum
a pointer to vector
nel number of elements in vector
amin minimum of a (make sure types of a and amin match)
*/
#define SUMA_MIN_VEC(a,nel,amin) { \
int m_I; \
amin = a[0]; \
for (m_I = 1; m_I < nel; m_I++) { \
if (a[m_I] < amin) amin = a[m_I]; \
} \
}
/*! \def SUMA_MIN_LOC_VEC(a,nel, amin, minloc)
\brief SUMA_MIN_VEC macro for minimum identification and location
a pointer to vector
nel (int) number of elements in vector
amin minimum of a (make sure types of a and amin match)
minloc (int) index into a where the minimum was found
*/
#define SUMA_MIN_LOC_VEC(a,nel,amin, minloc) { \
int m_I; \
amin = a[0]; \
minloc = 0; \
for (m_I = 1; m_I < nel; m_I++) { \
if (a[m_I] < amin) { \
amin = a[m_I]; \
minloc = m_I; \
} \
} \
}
/*! \def SUMA_MAX_VEC(a,nel,amax)
\brief SUMA_MAX_VEC macro for minimum
a pointer to vector
nel number of elements in vector
amax maximum of a (make sure types of a and amax match)
*/
#define SUMA_MAX_VEC(a,nel,amax) { \
int m_I; \
amax = a[0]; \
for (m_I = 1; m_I < nel; m_I++) { \
if (a[m_I] > amax) amax = a[m_I]; \
} \
}
/*! \def SUMA_MIN_MAX_VEC(a,nel,amin, amax, aminloc, amaxloc)
\brief SUMA_MIN_MAX_VEC macro for minimum and maximum
a pointer to vector
nel number of elements in vector
amin minimum of a (make sure types of a and amin match)
amax maximum of a (make sure types of a and amax match)
aminloc index where minimum is found
amaxloc index where maximum is found
*/
#define SUMA_MIN_MAX_VEC(a,nel, amin, amax, aminloc, amaxloc) { \
int m_I; \
amaxloc = 0; \
amax = a[0]; \
aminloc = 0; \
amin = a[0];\
for (m_I = 1; m_I < nel; m_I++) { \
if (a[m_I] > amax) { amax = a[m_I]; amaxloc = m_I; } \
else { if (a[m_I] < amin) { amin = a[m_I]; aminloc = m_I; } } \
} \
}
#define SUMA_MIN_MAX_VEC_STRIDE(a,nel, amin, amax, aminloc, amaxloc, stride) { \
int m_I; \
amaxloc = 0; \
amax = a[0]; \
aminloc = 0; \
amin = a[0];\
for (m_I = stride; m_I < nel; m_I = m_I+stride) { \
if (a[m_I] > amax) { amax = a[m_I]; amaxloc = m_I; } \
else { if (a[m_I] < amin) { amin = a[m_I]; aminloc = m_I; } } \
} \
}
/*
SUMA_ADD_VEC macro:
ADDS TWO VECTORS (a,b) POINT BY POINT (PROMOTING AS REQUIRED) AND
PUTS THE RESULT IN THE c VECTOR (DEMOTING IF REQUIRED).
SUMA_ADD_VEC(a,b,c,len,typea,typeb,typec)
a pointer to first vector.
b pointer to second vector.
c pointer to result vector.
len length of vectors (integer).
typea legal C type describing the type of a data.
typeb legal C type describing the type of b data.
typec legal C type describing the type of c data.
*/
#ifndef SUMA_ADD_VEC
#define SUMA_ADD_VEC(a,b,c,len,typea,typeb,typec) { \
typea *_PTA = a; \
typeb *_PTB = b; \
typec *_PTC = c; \
int m_IX; \
for(m_IX = 0 ; m_IX < (len) ; m_IX++) \
*_PTC++ = (typec)((*_PTA++) + (*_PTB++)); \
}
#endif
/*
SUMA_SUB_VEC macro:
SUBTRACTS TWO VECTORS (a,b) POINT BY POINT (PROMOTING AS REQUIRED) AND
PUTS THE RESULT IN THE c VECTOR (DEMOTING IF REQUIRED).
SUMA_SUB_VEC(a,b,c,len,typea,typeb,typec)
a pointer to first vector.
b pointer to second vector.
c pointer to result vector.
len length of vectors (integer).
typea legal C type describing the type of a data.
typeb legal C type describing the type of b data.
typec legal C type describing the type of c data.
*/
#ifndef SUMA_SUB_VEC
#define SUMA_SUB_VEC(a,b,c,len,typea,typeb,typec) { \
typea *_PTA = a; \
typeb *_PTB = b; \
typec *_PTC = c; \
int m_IX; \
for(m_IX = 0 ; m_IX < (len) ; m_IX++) \
*_PTC++ = (typec)((*_PTA++) - (*_PTB++)); \
}
#endif
/*
SUMA_MULT_VEC macro:
MULTIPLIES TWO VECTORS (a,b) POINT BY POINT (PROMOTING AS REQUIRED) AND
PUTS THE RESULT IN THE c VECTOR (DEMOTING IF REQUIRED).
SUMA_MULT_VEC(a,b,c,len,typea,typeb,typec)
a pointer to first vector.
b pointer to second vector.
c pointer to result vector.
len length of vectors (integer).
typea legal C type describing the type of a data.
typeb legal C type describing the type of b data.
typec legal C type describing the type of c data.
WARNING: The input data vectors are not cast to the type of c.
This means that at least one of the input types must
be able to represent the individual products without
overflow.
*/
#ifndef SUMA_MULT_VEC
#define SUMA_MULT_VEC(a,b,c,len,typea,typeb,typec) { \
typea *_PTA = a; \
typeb *_PTB = b; \
typec *_PTC = c; \
int m_IX; \
for(m_IX = 0 ; m_IX < (len) ; m_IX++) \
*_PTC++ = (typec)((*_PTA++) * (*_PTB++)); \
}
#endif
/*
SUMA_SUM_VEC macro:
FORMS THE SUM THE VECTOR a AND PUT THE RESULT IN THE
PREVIOUSLY DEFINED VARIABLE s.
SUMA_SUM_VEC(a,s,len,typea)
a pointer to first vector.
s variable used to store result (not a pointer).
len length of vector (integer).
typea legal C type describing the type of a data.
*/
#ifndef SUMA_SUM_VEC
#define SUMA_SUM_VEC(a,s,len,typea) { \
typea *_PTA = a; \
int m_IX; \
s = (*_PTA++); \
for(m_IX = 1 ; m_IX < (len) ; m_IX++) \
s += (*_PTA++); \
}
#endif
/*
SUMA_SCALE_VEC macro:
SCALES AND/OR CONVERTS (PROMOTES OR DEMOTES) THE INPUT VECTOR a
(of typea) AND COPIES THE SCALED VECTOR INTO ANOTHER VECTOR b
(of typeb).
SUMA_SCALE_VEC(a,b,s,len,typea,typeb)
a pointer to input vector.
b pointer to output vector.
s variable used to scale output vector (not a pointer).
len length of vectors (integer).
typea legal C type describing the type of a data.
typeb legal C type describing the type of b data.
*/
#ifndef SUMA_SCALE_VEC
#define SUMA_SCALE_VEC(a,b,s,len,typea,typeb) { \
typea *_PTA = (typea *)a; \
typeb *_PTB = (typeb *)b; \
int m_IX; \
for(m_IX = 0 ; m_IX < (len) ; m_IX++) \
*(_PTB)++ = (typeb)(s * (*(_PTA)++)); \
}
#endif
/* SUMA_EXTRACT_VEC macro:
copies a[ind] into b where ind is a vector of indices
SUMA_EXTRACT_VEC (a,b,ind,len)
a pointer to input vector
b pointer to output vector
ind vector containing the indices of the values in a to copy to b
len the length of ind (which is that of b too)
DO NOT SEND TWO POINTERS THAT POINT TO THE SAME LOCATION !
*/
#define SUMA_EXTRACT_VEC(a,b,ind,len,typea,typeb) { \
typea *_PTA = (typea *)a; \
typeb *_PTB = (typeb *)b; \
int m_IX; \
for(m_IX = 0 ; m_IX < (len) ; m_IX++) \
_PTB[m_IX] = _PTA[ind[m_IX]]; \
}
/* SUMA_CAT_VEC macro :
concatenates two vectors and b together such that a = [a b];
SUMA_CAT_VEC(a,b, catata, lenb,typea,typeb)
a pointer to first vector
b pointer to second vector
catata index indicating where b is to be concatenated
to a at. if catata = 6, then a[6] = b[0]
and a[7] = b[1] etc ...
make sure that you allocate enough space for a
lenb number of values in b
typea legal C type describing the type of a data.
typeb legal C type describing the type of b data.
*/
#define SUMA_CAT_VEC(a,b, catata, lenb,typea,typeb) { \
typea *_PTA = (typea *)a; \
typeb *_PTB = (typeb *)b; \
int m_IX; \
_PTA = _PTA + catata; \
for(m_IX = 0 ; m_IX < (lenb) ; m_IX++) \
*(_PTA)++ = (typea)(*(_PTB)++); \
}
/*!
SUMA_GET_MAT_ROW MACRO FOR GETTING A ROW FROM A MATRIX:
SUMA_GET_MAT_ROW(a,b,row,cols,typea,typeb)
a pointer to input 2D matrix.
b pointer to resultant 1D vector.
row index of row to extract from a
cols number of columns in matrix a
typea legal C type describing the type of a
typeb legal C type describing the type of b
*/
#define SUMA_GET_MAT_ROW(a,b,row,cols,typea,typeb) { \
typea **_AMX = (typea **)a; \
typeb *_PTB = (typeb *)b; \
typea *_PTA; \
int _JX; \
_PTA = _AMX[row]; \
for(_JX = 0 ; _JX < cols ; _JX++) \
*_PTB++ = (typeb) (*_PTA++); \
}
/*!
SUMA_GET_MAT_COL MACRO FOR GETTING A COLUMN FROM A MATRIX:
SUMA_GET_MAT_COL(a,b, col, rows,typea,typeb)
a pointer to input 2D matrix.
b pointer to resultant 1D vector.
col index of column in matrix a to extract to b
rows number of rows to in a
typea legal C type describing the type of a
typeb legal C type describing the type of b
*/
#define SUMA_GET_MAT_COL(a,b,col , rows, typea,typeb) { \
typea **_AMX = (typea **)a; \
typeb *_PTB = (typeb *)b; \
typea *_PTA; \
int m_IX,_JX; \
for(m_IX = 0 ; m_IX < rows ; m_IX++) { \
_PTA = _AMX[m_IX ] ; \
for(_JX = 0 ; _JX < col ; _JX++) \
_PTA++; \
*_PTB++ = (typeb)(*_PTA++); \
} \
}
/*! \def SUMA_MIN_MAT_COL(a, rows, cols, amin)
\brief SUMA_MIN_MAT_COL macro for minimum of each column in a matrix
a pointer to matrix (**)
rows number of rows
cols number of cols
amin minimum of each column in a (make sure types of a and amin match)
*/
#define SUMA_MIN_MAT_COL(a, rows, cols, amin) { \
int m_IX, _JX; \
for (m_IX = 0; m_IX < cols ; m_IX++) { \
amin[m_IX]=a[0][m_IX]; \
for (_JX = 1 ; _JX < rows ; _JX++) \
if (a[_JX][m_IX] < amin[m_IX]) amin[m_IX] = a[_JX][m_IX];\
}\
}
/*! \def SUMA_MAX_MAT_COL(a, rows, cols, amax)
\brief SUMA_MAX_MAT_COL macro for maximum of each column in a matrix
a pointer to matrix (**)
rows number of rows
cols number of cols
amax maximum of each column in a (make sure types of a and amin match)
*/
#define SUMA_MAX_MAT_COL(a, rows, cols, amax) { \
int m_IX, _JX; \
for (m_IX = 0; m_IX < cols ; m_IX++) { \
amax[m_IX]=a[0][m_IX]; \
for (_JX = 1 ; _JX < rows ; _JX++) \
if (a[_JX][m_IX] > amax[m_IX]) amax[m_IX] = a[_JX][m_IX];\
}\
}
/*! \def SUMA_MIN_MAX_SUM_MAT_COL(a, rows, cols, amin, amax, asum)
\brief SUMA_MIN_MAX_SUM_MAT_COL macro for minimum, maximum and sum of each column in a matrix
a pointer to matrix (**)
rows number of rows
cols number of cols
amin minimum of each column in a (make sure types of a and amin match)
amax maximum of each column in a (make sure types of a and amin match)
asum sum of each column in a (the mean is not computed because the / operation would then depend on the type of a)
*/
#define SUMA_MIN_MAX_SUM_MAT_COL(a, rows, cols, amin, amax, asum) { \
int m_IX, _JX; \
for (m_IX = 0; m_IX < cols ; m_IX++) { \
amax[m_IX]=a[0][m_IX]; \
amin[m_IX]=a[0][m_IX]; \
asum[m_IX]=a[0][m_IX]; \
for (_JX = 1 ; _JX < rows ; _JX++) { \
if (a[_JX][m_IX] > amax[m_IX]) amax[m_IX] = a[_JX][m_IX];\
if (a[_JX][m_IX] < amin[m_IX]) amin[m_IX] = a[_JX][m_IX];\
asum[m_IX] += a[_JX][m_IX]; \
} \
}\
}
/*! \def SUMA_MIN_MAX_SUM_VECMAT_COL(a, rows, cols, amin, amax, asum)
\brief SUMA_MIN_MAX_SUM_VECMAT_COL macro for minimum, maximum and sum of each column in a matrix stored in vector format
matrix 1 2 3
4 5 6
is stored as 1 2 3 4 5 6 ...
a pointer to vector containing rwos x cols elements
rows number of rows
cols number of cols
amin minimum of each column in a (make sure types of a and amin match)
amax maximum of each column in a (make sure types of a and amin match)
asum sum of each column in a (the mean is not computed because the / operation would then depend on the type of a)
\sa SUMA_MIN_MAX_SUM_VECMAT_MASK_COL
*/
#define SUMA_MIN_MAX_SUM_VECMAT_COL(a, rows, cols, amin, amax, asum) { \
int m_IX, m_JX, m_id; \
for (m_IX = 0; m_IX < cols ; m_IX++) { \
amax[m_IX]=a[m_IX]; \
amin[m_IX]=a[m_IX]; \
asum[m_IX]=a[m_IX]; \
for (m_JX = 1 ; m_JX < rows ; m_JX++) { \
m_id = cols * m_JX + m_IX; \
if (a[m_id] > amax[m_IX]) amax[m_IX] = a[m_id];\
if (a[m_id] < amin[m_IX]) amin[m_IX] = a[m_id];\
asum[m_IX] += a[m_id]; \
} \
} \
}
/*! \def SUMA_MIN_MAX_SUM_VECMAT_MASK_COL(a, rows, cols, rowmask, amin, amax, asum)
\brief SUMA_MIN_MAX_SUM_VECMAT_MASK_COL macro for minimum, maximum and sum of each column in a matrix stored in vector format
ONLY rows n where rowmask[n] is not 0 are used
matrix 1 2 3
4 5 6
7 8 9
is stored as 1 2 3 4 5 6 7 8 9...
a pointer to vector containing rwos x cols elements
rows number of rows
cols number of cols
rowmask pointer to vector containing rows x 1 mask values
amin minimum of each column in a (make sure types of a and amin match)
amax maximum of each column in a (make sure types of a and amin match)
asum sum of each column in a (the mean is not computed because the / operation would then depend on the type of a)
*/
#define SUMA_MIN_MAX_SUM_VECMAT_MASK_COL(a, rows, cols, rowmask, amin, amax, asum) { \
int m_IX, m_JX, m_id, m_start_row=0; \
m_JX = 0; \
while (!m_start_row && m_JX < rows) { \
if (rowmask[m_JX]) m_start_row = m_JX+1; \
++m_JX; \
} \
--m_start_row; \
for (m_IX = 0; m_IX < cols ; m_IX++) { \
amax[m_IX]=a[cols * m_start_row + m_IX]; \
amin[m_IX]=a[cols * m_start_row + m_IX]; \
asum[m_IX]=a[cols * m_start_row + m_IX]; \
++m_start_row; \
for (m_JX = m_start_row ; m_JX < rows ; m_JX++) { \
if (rowmask[m_JX]) { \
m_id = cols * m_JX + m_IX; \
if (a[m_id] > amax[m_IX]) amax[m_IX] = a[m_id];\
if (a[m_id] < amin[m_IX]) amin[m_IX] = a[m_id];\
asum[m_IX] += a[m_id]; \
} \
} \
} \
}
/*!
SUMA_MAT_TO_VEC MACRO rearranges a matrix into a vector
one row after the other:
SUMA_MAT_TO_VEC(a,b,rows,cols,typea,typeb)
a pointer to input 2D matrix.
b pointer to resultant D matrix.
rows number of rows in matrix a
cols number of columns in matrix a
typea legal C type describing the type of a
typeb legal C type describing the type of b
*/
#define SUMA_MAT_TO_VEC(a,b,rows,cols,typea,typeb) { \
typea **_AMX = (typea **)a; \
typeb *_PTB = (typeb *)b; \
typea *_PTA; \
int m_IX,_JX; \
for(m_IX = 0 ; m_IX < rows ; m_IX++) { \
_PTA = _AMX[m_IX ]; \
for(_JX = 0 ; _JX < cols ; _JX++) \
*_PTB++ = (typeb) (*_PTA++); \
} \
}
/*
SUMA_COPY_VEC macro: copies the contents of vector a into vector b
SUMA_COPY_VEC(a,b,len,typea,typeb)
a pointer to input vector.
b pointer to output vector.
len length of vectors (integer).
typea legal C type describing the type of a data.
typeb legal C type describing the type of b data.
*/
#define SUMA_COPY_VEC(a,b,len,typea,typeb) { \
typea *_PTA = (typea *)a; \
typeb *_PTB = (typeb *)b; \
int m_IX; \
for(m_IX = 0 ; m_IX < (len) ; m_IX++) \
*(_PTB)++ = (typeb)(*(_PTA)++); \
}
/*!
SUMA_INIT_VEC macro: initializes values in a vector
SUMA_INIT_VEC(a,len,val,typea)
*/
#define SUMA_INIT_VEC(a,len,val,typea) { \
int m_i; \
for (m_i = 0; m_i < (len) ; m_i ++) \
a[m_i] = (typea)val; \
}
#define SUMA_COPY_VALUE_IN_VEC(a, b, ia, ib, typea, typeb) { \
typea *_PTA = (typea *)a; \
typeb *_PTB = (typeb *)b; \
_PTB[ib] = (typeb)_PTA[ia]; \
}
#define SUMA_ASSIGN_VALUE_IN_VEC(a, ia, typea, val) { \
typea *_PTA = (typea *)a; \
_PTA[ia] = (typea)val; \
}
/*!
SUMA_DOTP_VEC macro:
FORMS THE SUM OF PRODUCTS OF TWO VECTORS (a,b) AND
PUTS THE RESULT IN THE PREVIOUSLY DEFINED VARIABLE s.
SUMA_DOTP_VEC(a,b,s,len,typea,typeb)
a pointer to first vector.
b pointer to second vector.
s variable used to store result (not a pointer).
len length of vectors (integer).
typea legal C type describing the type of a data.
typeb legal C type describing the type of b data.
WARNING: The input data vectors are not cast to the type of s.
This means that at least one of the input types must
be able to represent the individual products without
overflow.
*/
#define SUMA_DOTP_VEC(a,b,s,len,typea,typeb) { \
typea *_PTA = a; \
typeb *_PTB = b; \
int m_IX; \
s = (*_PTA++) * (*_PTB++); \
for(m_IX = 1 ; m_IX < (len) ; m_IX++) \
s += (*_PTA++) * (*_PTB++); \
}
/*!
\brief Macro to calculate the unit direction vector U from P1-->P2 and
the distance Un between P1 and P2.
If Un is 0, U is all zeros
\param P1/P2 (float *) 3-elements arrays containing XYZ of P1 and P2
\param U (float *) 3-elements array to contain unit direction vector
\param Un (float) the norm of |P1--P2|
*/
#define SUMA_UNIT_VEC(P1, P2, U, Un){ \
/* Calculate normalized unit vector of line formed by P1, P2 */ \
U[0] = P2[0] - P1[0]; \
U[1] = P2[1] - P1[1]; \
U[2] = P2[2] - P1[2]; \
Un = sqrt(U[0]*U[0] + U[1]*U[1] + U[2]*U[2]); \
if (Un) { \
U[0] /= Un; U[1] /= Un; U[2] /= Un; \
}else { \
U[0] = U[1] = U[2] = 0; \
} \
} \
/*!
\brief Macro to calculate normal of a triangle
\params P1, P2, P3: XYZ coordinates forming triangle
\param norm: Contains UN-NORMALIZED normal upon return
use SUMA_TRI_NORM_NORM for normalized normals
*/
#define SUMA_TRI_NORM(P1, P2, P3, norm){ \
double m_d1[3], m_d2[3]; \
m_d1[0] = P1[0] - P2[0]; \
m_d2[0] = P2[0] - P3[0]; \
m_d1[1] = P1[1] - P2[1]; \
m_d2[1] = P2[1] - P3[1]; \
m_d1[2] = P1[2] - P2[2]; \
m_d2[2] = P2[2] - P3[2]; \
norm[0] = m_d1[1]*m_d2[2] - m_d1[2]*m_d2[1]; \
norm[1] = m_d1[2]*m_d2[0] - m_d1[0]*m_d2[2]; \
norm[2] = m_d1[0]*m_d2[1] - m_d1[1]*m_d2[0]; \
}
#define SUMA_TRI_NORM_NORM(P1, P2, P3, norm){ \
double m_d; \
SUMA_TRI_NORM(P1, P2, P3, norm); \
m_d = sqrt(norm[0]*norm[0]+norm[1]*norm[1]+norm[2]*norm[2]); \
if (m_d == 0.0f) { norm[0] = norm[1] = norm[2] = 0.0; } \
else { norm[0] /= m_d; norm[1] /= m_d; norm[2] /= m_d;} \
}
/*!
\brief Macro to calculate the distance Un from P1-->P2 a
\param P1/P2 (float *) 3-elements arrays containing XYZ of P1 and P2
\param Un (float) the norm of |P1--P2|
*/
#define SUMA_SEG_NORM(P1, P2, Un){ \
static double m_dx, m_dy,m_dz; \
/* Calculate normalized unit vector of line formed by P1, P2 */ \
m_dx = P2[0] - P1[0]; \
m_dy = P2[1] - P1[1]; \
m_dz = P2[2] - P1[2]; \
Un = sqrt(m_dx*m_dx + m_dy*m_dy + m_dz*m_dz); \
} \
/*!
SUMA_MULT_MAT MACRO FOR MATRIX MULTIPLICATION:
SUMA_MULT_MAT(a,b,c,rowsa,colsa,colsb,typea,typeb,typec)
a pointer to first matirx.
b pointer to second matrix.
c pointer to result matrix.
rowsa number of rows in matrix a
colsa number of columns in matrix a
colsb number of columns in matrix b
typea legal C type describing the type of a
typeb legal C type describing the type of b
typec legal C type describing the type of c
*/
#define SUMA_MULT_MAT(a,b,c,rowsa,colsa,colsb,typea,typeb,typec) { \
typea **_AMX = (typea **)a; \
typeb **_BMX = (typeb **)b; \
typec **_CMX = (typec **)c; \
typea *_PTA; \
typeb *_PTB; \
typec *_PTC; \
int m_IX,_JX,_KX; \
for(m_IX = 0 ; m_IX < rowsa ; m_IX++) { \
_PTC = _CMX[m_IX]; \
_PTB = _BMX[0]; \
for(_JX = 0 ; _JX < colsb ; _JX++) { \
_PTA = _AMX[m_IX]; \
*_PTC = (*_PTA++) * (*_PTB++); \
for(_KX = 1 ; _KX < colsa ; _KX++) \
*_PTC += (*_PTA++)* _BMX[_KX][_JX]; \
_PTC++; \
} \
} \
}
/*!
SUMA_ADD_MAT MACRO FOR MATRIX ADDITION:
SUMA_ADD_MAT(a,b,c,rowsa,colsa,typea,typeb,typec)
a pointer to first matirx.
b pointer to second matrix.
c pointer to result matrix.
rowsa number of rows in matrix a
colsa number of columns in matrix a
typea legal C type describing the type of a
typeb legal C type describing the type of b
typec legal C type describing the type of c
*/
#define SUMA_ADD_MAT(a,b,c,rowsa,colsa,typea,typeb,typec) { \
typea **_AMX = (typea **)a; \
typeb **_BMX = (typeb **)b; \
typec **_CMX = (typec **)c; \
int m_IX,_JX; \
for(m_IX = 0 ; m_IX < rowsa ; m_IX++) { \
for(_JX = 0 ; _JX < colsa ; _JX++) { \
_CMX[m_IX][_JX] = _AMX[m_IX][_JX] + _BMX[m_IX][_JX]; \
} \
} \
}
/*!
SUMA_SUB_MAT MACRO FOR MATRIX SUBTRACTION:
SUMA_SUB_MAT(a,b,c,rowsa,colsa,typea,typeb,typec)
a pointer to first matirx.
b pointer to second matrix.
c pointer to result matrix.
rowsa number of rows in matrix a
colsa number of columns in matrix a
typea legal C type describing the type of a
typeb legal C type describing the type of b
typec legal C type describing the type of c
*/
#define SUMA_SUB_MAT(a,b,c,rowsa,colsa,typea,typeb,typec) { \
typea **_AMX = (typea **)a; \
typeb **_BMX = (typeb **)b; \
typec **_CMX = (typec **)c; \
int m_IX,_JX; \
for(m_IX = 0 ; m_IX < rowsa ; m_IX++) { \
for(_JX = 0 ; _JX < colsa ; _JX++) { \
_CMX[m_IX][_JX] = _AMX[m_IX][_JX] - _BMX[m_IX][_JX]; \
} \
} \
}
/*!
SUMA_TRANSP_MAT MACRO FOR MATRIX TRANSPOSE:
SUMA_TRANSP_MAT(a,b,rowsa,colsa,typea,typeb)
a pointer to first matirx.
b pointer to result matrix.
rowsa number of rows in matrix a
colsa number of columns in matrix a
typea legal C type describing the type of a
typeb legal C type describing the type of b
*/
#define SUMA_TRANSP_MAT(a,b,rowsa,colsa,typea,typeb) { \
typea **_AMX = (typea **)a; \
typeb **_BMX = (typeb **)b; \
int m_IX,_JX; \
for(m_IX = 0 ; m_IX < rowsa ; m_IX++) { \
for(_JX = 0 ; _JX < colsa ; _JX++) { \
_BMX[_JX][m_IX] = _AMX[m_IX][_JX]; \
} \
} \
}
/*!
SUMA_RGBmat_2_GLCOLAR4 copies an N x 3 RGB matrix into a 4N x 1 GL color array format
SUMA_RGBmat_2_GLCOLAR4(RGBmat, glcolar, N)
RGBmat (float **) N x 3 matrix of RGB values
glcolar (GLfloat *) (4 N) x 1 vector
*** Mar 17 04:
Added the SUMA_RGBvec versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGBmat_2_GLCOLAR4(RGBmat, glcolar, nrgb) {\
int m_I, m_I4 = 0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
glcolar[m_I4] = RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][2]; ++m_I4;\
++m_I4;\
}\
}
#define SUMA_RGBvec_2_GLCOLAR4(RGBvec, glcolar, nrgb) {\
int m_I, m_I4 = 0, m_I3=0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
++m_I4;\
}\
}
/*!
SUMA_GLCOLAR4_2_RGBmat copies 4N x 1 GL color array into an N x 3 RGB matrix format
SUMA_GLCOLAR4_2_RGBmat (glcolar, RGBmat, N)
glcolar (GLfloat *) (4 N) x 1 vector
RGBmat (float **) N x 3 matrix of RGB values
*** Mar 17 04:
Added the SUMA_RGBvec versions using RGBvec instead of RGBmat.
*/
#define SUMA_GLCOLAR4_2_RGBmat(glcolar, RGBmat, nrgb) {\
int m_I, m_I4 = 0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
RGBmat[m_I][0] = glcolar[m_I4]; ++m_I4;\
RGBmat[m_I][1] = glcolar[m_I4]; ++m_I4;\
RGBmat[m_I][2] = glcolar[m_I4]; ++m_I4;\
++m_I4;\
}\
}
#define SUMA_GLCOLAR4_2_RGBvec(glcolar, RGBvec, nrgb) {\
int m_I, m_I4 = 0, m_I3=0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
RGBvec[m_I3] = glcolar[m_I4]; ++m_I4; ++m_I3;\
RGBvec[m_I3] = glcolar[m_I4]; ++m_I4; ++m_I3;\
RGBvec[m_I3] = glcolar[m_I4]; ++m_I4; ++m_I3;\
++m_I4;\
}\
}
/*!
SUMA_FillBlanks_GLCOLAR4
fills nodes that received no color with the Nocolor Color
SUMA_FillBlanks_GLCOLAR4(isColored, N_Nodes, R, G, B, glcolar)
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored.
N_Nodes (int) total number of nodes
R, G, B (float 0..1) RGB values of NoColor color
glcolar (GLfloat *) (4 N_Nodes) x 1 vector
*/
#define SUMA_FillBlanks_GLCOLAR4(isColored, N_Nodes, R, G, B, glcolar) {\
int m_I, m_I4; \
for (m_I=0; m_I < N_Nodes; ++m_I) {\
if (!isColored[m_I]) {\
m_I4 = 4*m_I; \
glcolar[m_I4] = R; ++m_I4;\
glcolar[m_I4] = G; ++m_I4;\
glcolar[m_I4] = B; ++m_I4;\
}\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_FullNoGlobNoLoc2_GLCOLAR4_opacity
SUMA_RGB_FnGnL_AR4op_opacity
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
F (Full) means that N is equal to all the nodes in the surface
nG (NoGlob) means no opacity is applied to the color values (fully opaque)
nL (NoLocal) means no local gain (per node) is applied to the color values
SUMA_RGB_FnGnL_AR4op(RGBmat, glcolar, N, add)
RGBmat (float **) N x 3 matrix of RGB values
glcolar (GLfloat *) (4 N) x 1 vector
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_FnGnL_AR4op(RGBmat, glcolar, nrgb, isColored) {\
int m_I, m_I4 = 0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
isColored[m_I] = YUP;\
glcolar[m_I4] = RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][2]; ++m_I4;\
++m_I4;\
}\
}
#define SUMA_RGBv_FnGnL_AR4op(RGBvec, glcolar, nrgb, isColored) {\
int m_I, m_I4 = 0, m_I3=0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
isColored[m_I] = YUP;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
++m_I4;\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_FullGlobNoLoc2_GLCOLAR4_opacity
SUMA_RGB_FGnL_AR4op
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
F (Full) means that N is equal to all the nodes in the surface
G (Glob) means an opacity is applied to the color values
nL (NoLocal) means no local gain (per node) is applied to the color values
SUMA_RGB_FGnL_AR4op(RGBmat, glcolar, N, opacity, add)
RGBmat (float **) N x 3 matrix of RGB values
glcolar (GLfloat *) (4 N) x 1 vector
opacity (float) an opacity factor applied to each color R, G, B values in the entire list before adding it
to a pre-exising color opacity is not applied to the color of nodes that had not been colored thus far.
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
*** Dec 04 03:
Variant SUMA_RGB_FGnL_AR4op2
removed opacity scaling of RGBmat[m_I] and added clipping to 1.0
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_FGnL_AR4op(RGBmat, glcolar, nrgb, opacity, isColored) {\
int m_I, m_I4 = 0; \
float m_of;\
m_of = 1-opacity;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBmat[m_I][2]; ++m_I4;\
} else { /* not yet colored */\
glcolar[m_I4] = RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][2]; ++m_I4;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
#define SUMA_RGBv_FGnL_AR4op(RGBvec, glcolar, nrgb, opacity, isColored) {\
int m_I, m_I4 = 0, m_I3 = 0; \
float m_of;\
m_of = 1-opacity;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBvec[m_I3]; ++m_I4; ++m_I3;\
} else { /* not yet colored */\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
#define SUMA_RGB_FGnL_AR4op2(RGBmat, glcolar, nrgb, opacity, isColored) {\
int m_I, m_I4 = 0; \
float m_of;\
m_of = 1-opacity;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBmat[m_I][0]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBmat[m_I][1]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBmat[m_I][2]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
} else { /* not yet colored */\
glcolar[m_I4] = RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][2]; ++m_I4;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
#define SUMA_RGBv_FGnL_AR4op2(RGBvec, glcolar, nrgb, opacity, isColored) {\
int m_I, m_I4 = 0, m_I3 = 0; \
float m_of;\
m_of = 1-opacity;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
} else { /* not yet colored */\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_FullGlobLoc2_GLCOLAR4_opacity
but name was too long for some compilers
SUMA_RGB_FGL_AR4op
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
F (Full) means that N is equal to all the nodes in the surface
G (Glob) means an opacity is applied to the color values
L (Local) means a local gain (per node) is applied to the color values
SUMA_RGB_FGL_AR4op(RGBmat, glcolar, N, opacity, locgain, add)
RGBmat (float **) N x 3 matrix of RGB values
glcolar (GLfloat *) (4 N) x 1 vector
opacity (float) an opacity factor applied to each color R, G, B values in the entire list before adding it
to a pre-exising color opacity is not applied to the color of nodes that had not been colored thus far.
locgain (float *) a N x 1 vector of gains applied to their respective nodes
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
*** Dec 04 03:
Variant SUMA_RGB_FGL_AR4op2
removed opacity from m_of and added clipping to 1.0
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_FGL_AR4op(RGBmat, glcolar, nrgb, opacity, locgain, isColored) {\
int m_I, m_I4 = 0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
m_of = locgain[m_I] * opacity; /* Dec 04 03 changed from locgain[m_I] * opacity; */\
m_of2 = (1-opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][2]; ++m_I4;\
} else { /* not yet colored */\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][2]; ++m_I4;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
#define SUMA_RGBv_FGL_AR4op(RGBvec, glcolar, nrgb, opacity, locgain, isColored) {\
int m_I, m_I4 = 0, m_I3 = 0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
m_of = locgain[m_I] * opacity; /* Dec 04 03 changed from locgain[m_I] * opacity; */\
m_of2 = (1-opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; ++m_I4; ++m_I3;\
} else { /* not yet colored */\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
#define SUMA_RGB_FGL_AR4op2(RGBmat, glcolar, nrgb, opacity, locgain, isColored) {\
int m_I, m_I4 = 0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
m_of = locgain[m_I]; /* Dec 04 03 changed from locgain[m_I] * opacity; */\
m_of2 = (1-opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][0]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][1]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][2]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
} else { /* not yet colored */\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][0]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][1]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][2]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
#define SUMA_RGBv_FGL_AR4op2(RGBvec, glcolar, nrgb, opacity, locgain, isColored) {\
int m_I, m_I4 = 0, m_I3=0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (isColored[m_I]) { \
m_of = locgain[m_I]; /* Dec 04 03 changed from locgain[m_I] * opacity; */\
m_of2 = (1-opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
} else { /* not yet colored */\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
isColored[m_I] = YUP;\
} \
++m_I4;\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_FullNoGlobLoc2_GLCOLAR4_opacity
SUMA_RGB_FnGL_AR4op
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
F (Full) means that N is equal to all the nodes in the surface
nG (NoGlob) means no opacity is applied to the color values (fully opaque)
L (Local) means a local gain (per node) is applied to the color values
SUMA_RGB_FnGL_AR4op(RGBmat, glcolar, N, locgain, add)
RGBmat (float **) N x 3 matrix of RGB values
glcolar (GLfloat *) (4 N) x 1 vector
locgain (float *) a N x 1 vector of gains applied to their respective nodes
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_FnGL_AR4op(RGBmat, glcolar, nrgb, locgain, isColored) {\
int m_I, m_I4 = 0; \
float m_of;\
for (m_I=0; m_I < nrgb; ++m_I) {\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][2]; ++m_I4;\
isColored[m_I] = YUP;\
++m_I4;\
}\
}
#define SUMA_RGBv_FnGL_AR4op(RGBvec, glcolar, nrgb, locgain, isColored) {\
int m_I, m_I4 = 0, m_I3=0; \
float m_of;\
for (m_I=0; m_I < nrgb; ++m_I) {\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[m_I] = YUP;\
++m_I4;\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_PartNoGlobNoLoc2_GLCOLAR4_opacity
SUMA_RGB_PnGnL_AR4op
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
P (Part) means that colors are specified for some of the nodes only N < N_Nodes
nG (NoGlob) means no opacity is applied to the color values (fully opaque)
nL (NoLocal) means no local gain (per node) is applied to the color values
SUMA_RGB_PnGnL_AR4op(RGBmat, NodeId, glcolar, N, isColored, N_Nodes)
RGBmat (float **) N x 3 matrix of RGB values
NodeId (int *) N x 1 vector containing indices of nodes for wich color is specified in RGBmat
glcolar (GLfloat *) (4 N_Nodes) x 1 vector
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
when a node is assigned a color. Values of isColored for nodes that have not been visited remain unchanged
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_PnGnL_AR4op(RGBmat, NodeId, glcolar, nrgb, isColored, N_Node) {\
int m_I, m_I4 = 0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][2]; ++m_I4;\
isColored[NodeId[m_I]] = YUP;\
}\
}\
}
#define SUMA_RGBv_PnGnL_AR4op(RGBvec, NodeId, glcolar, nrgb, isColored, N_Node) {\
int m_I, m_I4 = 0, m_I3=0; \
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[NodeId[m_I]] = YUP;\
}\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_PartGlobNoLoc2_GLCOLAR4_opacity
SUMA_RGB_PGnL_AR4op
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
P (Part) means that colors are specified for some of the nodes only N < N_Nodes
G (Glob) means an opacity is applied to the color values
nL (NoLocal) means no local gain (per node) is applied to the color values
SUMA_RGB_PGnL_AR4op(RGBmat, NodeId, glcolar, N, isColored, opacity, N_Nodes)
RGBmat (float **) N x 3 matrix of RGB values
NodeId (int *) N x 1 vector containing indices of nodes for wich color is specified in RGBmat
glcolar (GLfloat *) (4 N_Nodes) x 1 vector
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
when a node is assigned a color. Values of isColored for nodes that have not been visited remain unchanged
opacity (float) an opacity factor applied to each color R, G, B values in the entire list before adding it
to a pre-exising color opacity is not applied to the color of nodes that had not been colored thus far.
*** Dec. 04 03:
Variant SUMA_RGB_PGnL_AR4op2
Instead of mixing like this: Col_new = (1 - opacity)*Col_1 + opacity *Col_2;
I am using Col_new = (1 - opacity)*Col_1 + Col_2; if (Col_new > 1) Col_new = 1
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_PGnL_AR4op(RGBmat, NodeId, glcolar, nrgb, isColored, opacity, N_Node) {\
int m_I, m_I4 = 0, m_II; \
float m_of;\
m_of = (1 - opacity); \
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is, Opacity gain should not be applied Wed Apr 2 17:31:33 EST 2003*/\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][2]; ++m_I4;\
isColored[NodeId[m_I]] = YUP;\
}else {/* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBmat[m_I][2]; ++m_I4;\
}\
}\
}\
}
#define SUMA_RGBv_PGnL_AR4op(RGBvec, NodeId, glcolar, nrgb, isColored, opacity, N_Node) {\
int m_I, m_I4 = 0, m_II, m_I3=0; \
float m_of;\
m_of = (1 - opacity); \
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is, Opacity gain should not be applied Wed Apr 2 17:31:33 EST 2003*/\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[NodeId[m_I]] = YUP;\
}else {/* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + opacity * RGBvec[m_I3]; ++m_I4; ++m_I3;\
}\
}\
}\
}
#define SUMA_RGB_PGnL_AR4op2(RGBmat, NodeId, glcolar, nrgb, isColored, opacity, N_Node) {\
int m_I, m_I4 = 0, m_II; \
float m_of;\
m_of = (1 - opacity); \
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is, Opacity gain should not be applied Wed Apr 2 17:31:33 EST 2003*/\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = RGBmat[m_I][2]; ++m_I4;\
isColored[NodeId[m_I]] = YUP;\
}else {/* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBmat[m_I][0]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBmat[m_I][1]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBmat[m_I][2]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
}\
}\
}\
}
#define SUMA_RGBv_PGnL_AR4op2(RGBvec, NodeId, glcolar, nrgb, isColored, opacity, N_Node) {\
int m_I, m_I4 = 0, m_II, m_I3=0; \
float m_of;\
m_of = (1 - opacity); \
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is, Opacity gain should not be applied Wed Apr 2 17:31:33 EST 2003*/\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[NodeId[m_I]] = YUP;\
}else {/* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of * glcolar[m_I4] + RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
}\
}\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_PartGlobLoc2_GLCOLAR4_opacity
SUMA_RGB_PGL_AR4op
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
P (Part) means that colors are specified for some of the nodes only N < N_Nodes
G (Glob) means an opacity is applied to the color values
L (Local) means a local gain (per node) is applied to the color values
SUMA_RGB_PGL_AR4op(RGBmat, NodeId, glcolar, N, isColored, opacity, locgain, add, N_Nodes)
RGBmat (float **) N x 3 matrix of RGB values
NodeId (int *) N x 1 vector containing indices of nodes for wich color is specified in RGBmat
glcolar (GLfloat *) (4 N_Nodes) x 1 vector
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
when a node is assigned a color. Values of isColored for nodes that have not been visited remain unchanged
opacity (float) an opacity factor applied to each color R, G, B values in the entire list before adding it
to a pre-exising color opacity is not applied to the color of nodes that had not been colored thus far.
locgain (float *) N x 1 vector of gains applied to their respective nodes
*** Dec. 04 03:
Variant SUMA_RGB_PGL_AR4op2
Instead of mixing like this: Col_new = (1 - opacity) *Col_1 + opacity * locgain *Col_2;
I am using Col_new = (1 - opacity)*Col_1 + locgain * Col_2; if (Col_new > 1) Col_new = 1
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_PGL_AR4op(RGBmat, NodeId, glcolar, nrgb, isColored, opacity, locgain, N_Node) {\
int m_I, m_I4 = 0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is */\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][2]; ++m_I4;\
isColored[NodeId[m_I]] = YUP;\
}else { /* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
m_of = (locgain[m_I] * opacity); /* Dec. 04 03, changed from locgain[m_I] * opacity */\
m_of2 = (1 - opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][2]; ++m_I4;\
}\
}\
}\
}
#define SUMA_RGBv_PGL_AR4op(RGBvec, NodeId, glcolar, nrgb, isColored, opacity, locgain, N_Node) {\
int m_I, m_I4 = 0, m_I3=0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is */\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[NodeId[m_I]] = YUP;\
}else { /* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
m_of = (locgain[m_I] * opacity); /* Dec. 04 03, changed from locgain[m_I] * opacity */\
m_of2 = (1 - opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; ++m_I4; ++m_I3;\
}\
}\
}\
}
#define SUMA_RGB_PGL_AR4op2(RGBmat, NodeId, glcolar, nrgb, isColored, opacity, locgain, N_Node) {\
int m_I, m_I4 = 0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is */\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][2]; ++m_I4;\
isColored[NodeId[m_I]] = YUP;\
}else { /* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
m_of = (locgain[m_I]); /* Dec. 04 03, changed from locgain[m_I] * opacity */\
m_of2 = (1 - opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][0]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][1]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBmat[m_I][2]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4;\
}\
}\
}\
}
#define SUMA_RGBv_PGL_AR4op2(RGBvec, NodeId, glcolar, nrgb, isColored, opacity, locgain, N_Node) {\
int m_I, m_I4 = 0, m_I3=0; \
float m_of, m_of2;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
if (!isColored[NodeId[m_I]]) { /* a new color, put it down as it is */\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[NodeId[m_I]] = YUP;\
}else { /* mixing to be done */\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
m_of = (locgain[m_I]); /* Dec. 04 03, changed from locgain[m_I] * opacity */\
m_of2 = (1 - opacity);\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
glcolar[m_I4] = m_of2 * glcolar[m_I4] + m_of * RGBvec[m_I3]; SUMA_CLIP_UB(glcolar[m_I4], 1.0); ++m_I4; ++m_I3;\
}\
}\
}\
}
/*!
This macro used to be called: SUMA_RGBmat_PartNoGlobLoc2_GLCOLAR4_opacity
SUMA_RGB_PnGL_AR4op
copies an N x 3 RGB matrix into a 4N x 1 GL color array format
P (Part) means that colors are specified for some of the nodes only N < N_Nodes
nG (NoGlob) means no opacity is applied to the color values (fully opaque)
L (Local) means a local gain (per node) is applied to the color values
SUMA_RGB_PnGL_AR4op(RGBmat, NodeId, glcolar, N, isColored, locgain, add, N_Nodes)
RGBmat (float **) N x 3 matrix of RGB values
NodeId (int *) N x 1 vector containing indices of nodes for wich color is specified in RGBmat
glcolar (GLfloat *) (4 N_Nodes) x 1 vector
isColored (SUMA_Boolean) N_Nodes x 1 vector indicating that a node was colored. ONLY YUP/1 are placed
when a node is assigned a color. Values of isColored for nodes that have not been visited remain unchanged
locgain (float *) N x 1 vector of gains applied to their respective nodes
*** Mar 17 04:
Added the SUMA_RGBv versions using RGBvec instead of RGBmat.
*/
#define SUMA_RGB_PnGL_AR4op(RGBmat, NodeId, glcolar, nrgb, isColored, locgain, N_Node) {\
int m_I, m_I4 = 0; \
float m_of;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
m_I4 = 4*NodeId[m_I]; \
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][0]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][1]; ++m_I4;\
glcolar[m_I4] = locgain[m_I] * RGBmat[m_I][2]; ++m_I4;\
isColored[NodeId[m_I]] = YUP;\
}\
}\
}
#define SUMA_RGBv_PnGL_AR4op(RGBvec, NodeId, glcolar, nrgb, isColored, locgain, N_Node) {\
int m_I, m_I4 = 0, m_I3=0; \
float m_of;\
for (m_I=0; m_I < nrgb; ++m_I) {\
if (NodeId[m_I] < N_Node) {\
m_I4 = 4*NodeId[m_I]; \
m_I3 = 3*m_I; \
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
glcolar[m_I4] = locgain[m_I] * RGBvec[m_I3]; ++m_I4; ++m_I3;\
isColored[NodeId[m_I]] = YUP;\
}\
}\
}
#endif
syntax highlighted by Code2HTML, v. 0.9.1