~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

Linux Cross Reference
Tina5/tina-libs/tina/math/mathVec_geom.c

Version: ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  1 /**********
  2  *
  3  * Copyright (c) 2003, Division of Imaging Science and Biomedical Engineering,
  4  * University of Manchester, UK.  All rights reserved.
  5  * 
  6  * Redistribution and use in source and binary forms, with or without modification, 
  7  * are permitted provided that the following conditions are met:
  8  * 
  9  *   . Redistributions of source code must retain the above copyright notice, 
 10  *     this list of conditions and the following disclaimer.
 11  *    
 12  *   . Redistributions in binary form must reproduce the above copyright notice,
 13  *     this list of conditions and the following disclaimer in the documentation 
 14  *     and/or other materials provided with the distribution.
 15  * 
 16  *   . Neither the name of the University of Manchester nor the names of its
 17  *     contributors may be used to endorse or promote products derived from this 
 18  *     software without specific prior written permission.
 19  * 
 20  * 
 21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
 22  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
 23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 
 25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
 26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
 27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 
 29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
 30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
 31  * POSSIBILITY OF SUCH DAMAGE.
 32  *
 33  **********
 34  *
 35  * Program :    TINA
 36  * File    :  $Source: /home/tina/cvs/tina-libs/tina/math/mathVec_geom.c,v $
 37  * Date    :  $Date: 2003/09/23 11:32:20 $
 38  * Version :  $Revision: 1.4 $
 39  * CVS Id  :  $Id: mathVec_geom.c,v 1.4 2003/09/23 11:32:20 matts Exp $
 40  *
 41  * Author  :  Legacy TINA
 42  *
 43  * Notes : Vector geometry (simple).
 44  *
 45  *********
 46 */
 47 /** 
 48  *  @file
 49  *  @brief  Vector Geometry.    
 50  *
 51  *
 52  * 
 53 */
 54 
 55 #include "mathVec_geom.h"
 56 
 57 #if HAVE_CONFIG_H
 58 #include <config.h>
 59 #endif
 60 
 61 
 62 #include <math.h>
 63 #include <tina/sys/sysDef.h>
 64 #include <tina/sys/sysPro.h>
 65 #include <tina/math/math_VecDef.h>
 66 #include <tina/math/math_TypDef.h>
 67 #include <tina/math/math_TypPro.h>
 68 #include <tina/math/mathVec_vector.h>
 69 #include <tina/math/mathVec_apply.h>
 70 #include <tina/math/mathVec_combine.h>
 71 
 72 double          vector_dot(Vector * v1, Vector * v2)
 73 {
 74         int             i, nmin;
 75         double          sum = 0.0, v1i, v2i;
 76 
 77         if (v1 == NULL || v2 == NULL)
 78                 return (0.0);
 79         nmin = MIN(v1->n, v2->n);
 80         for (i = 0; i < nmin; i++)
 81         {
 82                 VECTOR_GET(v1, i, v1i);
 83                 VECTOR_GET(v2, i, v2i);
 84                 sum += v1i * v2i;
 85         }
 86         return (sum);
 87 }
 88 
 89 Complex         vector_dotz(Vector * v1, Vector * v2)
 90 {
 91         int             i, nmin;
 92         Complex         sum = {Complex_id};
 93         Complex         v1i = {Complex_id};
 94         Complex         v2i = {Complex_id};
 95 
 96         if (v1 == NULL || v2 == NULL)
 97                 return (cmplx_zero());
 98         nmin = MIN(v1->n, v2->n);
 99         sum = cmplx_zero();
100         for (i = 0; i < nmin; i++)
101         {
102                 VECTOR_GETZ(v1, i, v1i);
103                 VECTOR_GETZ(v2, i, v2i);
104                 sum = cmplx_sum(sum, cmplx_cprod(v1i, v2i));
105         }
106         return (sum);
107 }
108 
109 double          vector_mod(Vector * v)
110 {
111         if (v == NULL)
112                 return (0.0);
113 
114         if (v->vtype == complex_v)
115                 return (sqrt(vector_dotz(v, v).x));
116         else
117                 return (sqrt(vector_dot(v, v)));
118 }
119 
120 Vector         *vector_unit(Vector * v)
121 {
122         double          m = vector_mod(v);
123 
124         return (vector_times(1.0 / m, v));
125 }
126 
127 double          vector_sqrmod(Vector * v)
128 {
129         if (v == NULL)
130                 return (0.0);
131 
132         if (v->vtype == complex_v)
133                 return (vector_dotz(v, v).x);
134         else
135                 return (vector_dot(v, v));
136 }
137 
138 double          vector_dist(Vector * v1, Vector * v2)
139 {
140         Vector         *v12 = vector_diff(v2, v1);
141         double          d;
142 
143         d = vector_mod(v12);
144         vector_free(v12);
145         return (d);
146 }
147 
148 double          vector_sqrdist(Vector * v1, Vector * v2)
149 {
150         Vector         *v12 = vector_diff(v2, v1);
151         double          d;
152 
153         d = vector_sqrmod(v12);
154         vector_free(v12);
155         return (d);
156 }
157 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

This page was automatically generated by the LXR engine.
Visit the LXR main site for more information.