00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
00041 #include <stdio.h>
00042 #include <string.h>
00043 #include <math.h>
00044 #include "memvirtu.h"
00045 #include "lowmacro.h"
00046 #include "lowparam.h"
00047 #include "lowsolid.h"
00048 #include "eulerops.h"
00049 #include "vectorop.h"
00050 #include "mancommd.h"
00051 #include "rndround.h"
00052 #include "curvgeom.h"
00053
00054 void calc_point(vector v1, vector v2, real t, vector p)
00055 {
00056 vecminus(p, v2, v1);
00057 vecesc(p, p, t);
00058 vecplus(p, p, v1);
00059 }
00060
00061 real angle_edge(HPTYPE he)
00062 {
00063 vector v1, v2, v3;
00064 real alfa, aux1, aux2;
00065
00066 veccopy(v3, VerVCoord(HalVtx(mate(he))));
00067 vecminus(v1, v3, VerVCoord(HalVtx(he)));
00068 veccopy(v3, VerVCoord(HalVtx(HalPrv(he))));
00069 vecminus(v2, v3, VerVCoord(HalVtx(he)));
00070 aux1 = dot(v1, v2);
00071 aux2 = sqrt(v1[0] * v1[0] + v1[1] * v1[1] + v1[2] * v1[2]) * sqrt(v2[0] * v2[0] + v2[1] * v2[1] + v2[2] * v2[2]);
00072 alfa = acos(aux1 / aux2);
00073 cross(v3, v1, v2);
00074 normalize(v3);
00075 vecminus(v1, v3, FacFeq(LooLFace(HalWLoop(he))));
00076 aux1 = v1[0] + v1[1] + v1[2];
00077 if (comp(aux1, 0.0, EPS) == 0)
00078 {
00079 return(alfa);
00080 }
00081 else
00082 {
00083 alfa = (2 * PI) - alfa;
00084 return(alfa);
00085 }
00086 }
00087
00088 int GetEdges(VPTYPE v, int flag)
00089 {
00090 HPTYPE he;
00091 int n = 0;
00092
00093 he = VerVEdge(v);
00094 do
00095 {
00096 if (flag == -1)
00097 {
00098 n++;
00099 }
00100 if (flag == EdgFgRound(HalEdg(he)))
00101 {
00102 n++;
00103 }
00104 he = HalNxt(mate(he));
00105 } while (he != VerVEdge(v));
00106 return(n);
00107 }
00108
00109 void CLC(SPTYPE s, HPTYPE he, vector p1, vector p2, vector c)
00110 {
00111 vector t1, t2;
00112
00113 maxct = getmaxct(s);
00114 lgeo_arc(c, p1, p2, t1, t2, vecd(c, p1), vecd(c, p2));
00115 MSD_highNewCurvePolyline(SolSolidNo(s), ++maxct);
00116 MSD_highAddPointToCurve(SolSolidNo(s), maxct, p1[0], p1[1], p1[2]);
00117 MSD_highAddPointToCurve(SolSolidNo(s), maxct, t1[0], t1[1], t1[2]);
00118 MSD_highAddPointToCurve(SolSolidNo(s), maxct, t2[0], t2[1], t2[2]);
00119 MSD_highAddPointToCurve(SolSolidNo(s), maxct, p2[0], p2[1], p2[2]);
00120 MSD_lowSetCurveAtributeToEdge(he, MSD_getCurve(s, maxct));
00121 }
00122
00123 void lgeo_arc(vector c, vector p1, vector p2, vector t1, vector t2, real d1, real d2)
00124 {
00125 vector n;
00126
00127 vecminus(n, c, p1);
00128 normalize(n);
00129 t1[0] = p1[0] + d1 * 0.552 * n[0];
00130 t1[1] = p1[1] + d1 * 0.552 * n[1];
00131 t1[2] = p1[2] + d1 * 0.552 * n[2];
00132 vecminus(n, c, p2);
00133 normalize(n);
00134 t2[0] = p2[0] + d2 * 0.552 * n[0];
00135 t2[1] = p2[1] + d2 * 0.552 * n[1];
00136 t2[2] = p2[2] + d2 * 0.552 * n[2];
00137 }
00138
00139 void _line(vector r1, real d1, vector r2, real d2, vector p1, vector p2, vector n)
00140 {
00141 vector pv, r;
00142
00143 veczer(pv);
00144 veczer(r);
00145
00146 vecminus(r, r2, r1);
00147 cross(pv, n, r);
00148 normalize(pv);
00149 vecesc(pv, pv, d1);
00150 vecplus(p1, r1, pv);
00151 normalize(pv);
00152 vecesc(pv, pv, d2);
00153 vecplus(p2, r2, pv);
00154 }
00155
00156 void line_parallel(vector r1, vector r2, vector p1, vector p2, vector n, real d)
00157 {
00158 vector pv, r;
00159
00160 veczer(pv);
00161 veczer(r);
00162
00163 vecminus(r, r2, r1);
00164 cross(pv, n, r);
00165 normalize(pv);
00166 vecesc(pv, pv, d);
00167 vecplus(p2, r2, pv);
00168 vecplus(p1, r1, pv);
00169 }
00170
00171 real calc_t(vector v1, vector v2, vector p)
00172 {
00173 vector a1, a2;
00174 real a3, a4, at;
00175
00176 veczer(a1);
00177 veczer(a2);
00178 vecminus(a1, p, v1);
00179 vecminus(a2, v2, v1);
00180 a3 = sqrt(a1[0] * a1[0] + a1[1] * a1[1] + a1[2] * a1[2]);
00181 a4 = sqrt(a2[0] * a2[0] + a2[1] * a2[1] + a2[2] * a2[2]);
00182 at = (a3 * a4) / (a4 * a4);
00183 return(at);
00184 }
00185
00186 void line_inter(vector v1, vector v2, vector v3, vector v4, vector p)
00187 {
00188 double D, a1, a2, b1, b2, c1, c2, t1;
00189 vector n1, n2, n;
00190 int i, drop;
00191
00192 vecminus(n1, v2, v1);
00193 vecminus(n2, v4, v3);
00194 cross(n, n1, n2);
00195 for (i = 0; i < 3; i++)
00196 {
00197 if (comp(n[i], 0, EPS) == 0)
00198 {
00199 n[i] = 0;
00200 }
00201 }
00202 normalize(n);
00203 drop = getdrop(n);
00204
00205 switch (drop)
00206 {
00207 case X:
00208 a1 = v2[1] - v1[1];
00209 a2 = v2[2] - v1[2];
00210 b1 = v3[1] - v4[1];
00211 b2 = v3[2] - v4[2];
00212 c1 = v1[1] - v3[1];
00213 c2 = v1[2] - v3[2];
00214 break;
00215
00216 case Y:
00217 a1 = v2[0] - v1[0];
00218 a2 = v2[2] - v1[2];
00219 b1 = v3[0] - v4[0];
00220 b2 = v3[2] - v4[2];
00221 c1 = v1[0] - v3[0];
00222 c2 = v1[2] - v3[2];
00223 break;
00224
00225 case Z:
00226 a1 = v2[0] - v1[0];
00227 a2 = v2[1] - v1[1];
00228 b1 = v3[0] - v4[0];
00229 b2 = v3[1] - v4[1];
00230 c1 = v1[0] - v3[0];
00231 c2 = v1[1] - v3[1];
00232 break;
00233 }
00234
00235 if (comp(D = a1 * b2 - a2 * b1, 0.0, EPS) != 0)
00236 {
00237 t1 = (c2 * b1 - c1 * b2) / D;
00238 p[0] = v1[0] + t1 * (v2[0] - v1[0]);
00239 p[1] = v1[1] + t1 * (v2[1] - v1[1]);
00240 p[2] = v1[2] + t1 * (v2[2] - v1[2]);
00241 }
00242 }
00243
00244 void point_perp(vector v1, vector v2, vector p, vector n, real d)
00245 {
00246 vector pv, v;
00247
00248 veczer(pv);
00249 veczer(v);
00250
00251 vecminus(v, v2, v1);
00252 cross(pv, n, v);
00253 normalize(pv);
00254 vecesc(pv, pv, d);
00255 vecplus(p, v1, pv);
00256 }