2008-04-14 10:28:32 +00:00
|
|
|
#include "solvespace.h"
|
|
|
|
|
2008-04-27 09:03:01 +00:00
|
|
|
char *Constraint::DescriptionString(void) {
|
|
|
|
static char ret[1024];
|
2008-04-28 07:18:39 +00:00
|
|
|
sprintf(ret, "c%03x", h.v);
|
2008-04-27 09:03:01 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-04-14 10:28:32 +00:00
|
|
|
hConstraint Constraint::AddConstraint(Constraint *c) {
|
|
|
|
SS.constraint.AddAndAssignId(c);
|
2008-04-27 05:00:12 +00:00
|
|
|
|
2008-04-27 09:03:01 +00:00
|
|
|
SS.GenerateAll(SS.GW.solving == GraphicsWindow::SOLVE_ALWAYS);
|
2008-04-14 10:28:32 +00:00
|
|
|
return c->h;
|
|
|
|
}
|
|
|
|
|
2008-04-23 07:29:19 +00:00
|
|
|
void Constraint::ConstrainCoincident(hEntity ptA, hEntity ptB) {
|
|
|
|
Constraint c;
|
|
|
|
memset(&c, 0, sizeof(c));
|
|
|
|
c.group = SS.GW.activeGroup;
|
2008-04-27 05:00:12 +00:00
|
|
|
c.workplane = SS.GW.activeWorkplane;
|
2008-04-23 07:29:19 +00:00
|
|
|
c.type = Constraint::POINTS_COINCIDENT;
|
|
|
|
c.ptA = ptA;
|
|
|
|
c.ptB = ptB;
|
2008-04-27 05:00:12 +00:00
|
|
|
AddConstraint(&c);
|
2008-04-23 07:29:19 +00:00
|
|
|
}
|
|
|
|
|
2008-04-14 10:28:32 +00:00
|
|
|
void Constraint::MenuConstrain(int id) {
|
|
|
|
Constraint c;
|
|
|
|
memset(&c, 0, sizeof(c));
|
|
|
|
c.group = SS.GW.activeGroup;
|
2008-04-27 05:00:12 +00:00
|
|
|
c.workplane = SS.GW.activeWorkplane;
|
2008-04-14 10:28:32 +00:00
|
|
|
|
|
|
|
SS.GW.GroupSelection();
|
|
|
|
#define gs (SS.GW.gs)
|
|
|
|
|
|
|
|
switch(id) {
|
2008-04-27 05:00:12 +00:00
|
|
|
case GraphicsWindow::MNU_DISTANCE_DIA: {
|
2008-04-14 10:28:32 +00:00
|
|
|
if(gs.points == 2 && gs.n == 2) {
|
|
|
|
c.type = PT_PT_DISTANCE;
|
|
|
|
c.ptA = gs.point[0];
|
|
|
|
c.ptB = gs.point[1];
|
|
|
|
} else if(gs.lineSegments == 1 && gs.n == 1) {
|
|
|
|
c.type = PT_PT_DISTANCE;
|
2008-04-19 11:09:47 +00:00
|
|
|
Entity *e = SS.GetEntity(gs.entity[0]);
|
2008-04-27 03:26:27 +00:00
|
|
|
c.ptA = e->point[0];
|
|
|
|
c.ptB = e->point[1];
|
2008-04-14 10:28:32 +00:00
|
|
|
} else {
|
|
|
|
Error("Bad selection for distance / diameter constraint.");
|
|
|
|
return;
|
|
|
|
}
|
2008-04-27 05:00:12 +00:00
|
|
|
Vector n = SS.GW.projRight.Cross(SS.GW.projUp);
|
2008-05-05 06:18:01 +00:00
|
|
|
Vector a = SS.GetEntity(c.ptA)->PointGetNum();
|
|
|
|
Vector b = SS.GetEntity(c.ptB)->PointGetNum();
|
2008-04-27 05:00:12 +00:00
|
|
|
|
|
|
|
c.disp.offset = n.Cross(a.Minus(b)).WithMagnitude(50);
|
2008-04-22 10:53:42 +00:00
|
|
|
c.exprA = Expr::FromString("0")->DeepCopyKeep();
|
|
|
|
c.ModifyToSatisfy();
|
2008-04-14 10:28:32 +00:00
|
|
|
AddConstraint(&c);
|
|
|
|
break;
|
2008-04-27 05:00:12 +00:00
|
|
|
}
|
2008-04-14 10:28:32 +00:00
|
|
|
|
2008-04-21 08:16:38 +00:00
|
|
|
case GraphicsWindow::MNU_ON_ENTITY:
|
|
|
|
if(gs.points == 2 && gs.n == 2) {
|
|
|
|
c.type = POINTS_COINCIDENT;
|
|
|
|
c.ptA = gs.point[0];
|
|
|
|
c.ptB = gs.point[1];
|
2008-05-05 11:17:00 +00:00
|
|
|
} else if(gs.points == 1 && gs.workplanes == 1 && gs.n == 2) {
|
2008-04-21 08:16:38 +00:00
|
|
|
c.type = PT_IN_PLANE;
|
|
|
|
c.ptA = gs.point[0];
|
|
|
|
c.entityA = gs.entity[0];
|
2008-04-28 09:40:02 +00:00
|
|
|
} else if(gs.points == 1 && gs.lineSegments == 1 && gs.n == 2) {
|
|
|
|
c.type = PT_ON_LINE;
|
|
|
|
c.ptA = gs.point[0];
|
|
|
|
c.entityA = gs.entity[0];
|
2008-04-21 08:16:38 +00:00
|
|
|
} else {
|
|
|
|
Error("Bad selection for on point / curve / plane constraint.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
AddConstraint(&c);
|
|
|
|
break;
|
|
|
|
|
2008-04-22 05:00:49 +00:00
|
|
|
case GraphicsWindow::MNU_EQUAL:
|
|
|
|
if(gs.lineSegments == 2 && gs.n == 2) {
|
|
|
|
c.type = EQUAL_LENGTH_LINES;
|
|
|
|
c.entityA = gs.entity[0];
|
|
|
|
c.entityB = gs.entity[1];
|
|
|
|
} else {
|
|
|
|
Error("Bad selection for equal length / radius constraint.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
AddConstraint(&c);
|
|
|
|
break;
|
|
|
|
|
2008-04-30 08:14:32 +00:00
|
|
|
case GraphicsWindow::MNU_AT_MIDPOINT:
|
|
|
|
if(gs.lineSegments == 1 && gs.points == 1 && gs.n == 2) {
|
|
|
|
c.type = AT_MIDPOINT;
|
|
|
|
c.entityA = gs.entity[0];
|
|
|
|
c.ptA = gs.point[0];
|
2008-05-05 11:17:00 +00:00
|
|
|
} else if(gs.lineSegments == 1 && gs.workplanes == 1 && gs.n == 2) {
|
2008-05-01 06:53:50 +00:00
|
|
|
c.type = AT_MIDPOINT;
|
2008-05-05 11:17:00 +00:00
|
|
|
int i = SS.GetEntity(gs.entity[0])->IsWorkplane() ? 1 : 0;
|
2008-05-01 06:53:50 +00:00
|
|
|
c.entityA = gs.entity[i];
|
|
|
|
c.entityB = gs.entity[1-i];
|
2008-04-30 08:14:32 +00:00
|
|
|
} else {
|
|
|
|
Error("Bad selection for at midpoint constraint.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
AddConstraint(&c);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case GraphicsWindow::MNU_SYMMETRIC:
|
2008-05-05 11:17:00 +00:00
|
|
|
if(gs.points == 2 && gs.workplanes == 1 && gs.n == 3) {
|
2008-04-30 08:14:32 +00:00
|
|
|
c.type = SYMMETRIC;
|
|
|
|
c.entityA = gs.entity[0];
|
|
|
|
c.ptA = gs.point[0];
|
|
|
|
c.ptB = gs.point[1];
|
2008-05-05 11:17:00 +00:00
|
|
|
} else if(gs.lineSegments == 1 && gs.workplanes == 1 && gs.n == 2) {
|
2008-04-30 08:14:32 +00:00
|
|
|
c.type = SYMMETRIC;
|
2008-05-05 11:17:00 +00:00
|
|
|
int i = SS.GetEntity(gs.entity[0])->IsWorkplane() ? 1 : 0;
|
2008-04-30 08:14:32 +00:00
|
|
|
Entity *line = SS.GetEntity(gs.entity[i]);
|
|
|
|
c.entityA = gs.entity[1-i];
|
|
|
|
c.ptA = line->point[0];
|
|
|
|
c.ptB = line->point[1];
|
|
|
|
} else {
|
|
|
|
Error("Bad selection for symmetric constraint.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
AddConstraint(&c);
|
|
|
|
break;
|
|
|
|
|
2008-04-23 07:29:19 +00:00
|
|
|
case GraphicsWindow::MNU_VERTICAL:
|
|
|
|
case GraphicsWindow::MNU_HORIZONTAL: {
|
|
|
|
hEntity ha, hb;
|
2008-04-27 05:00:12 +00:00
|
|
|
if(c.workplane.v == Entity::FREE_IN_3D.v) {
|
|
|
|
Error("Select workplane before constraining horiz/vert.");
|
|
|
|
return;
|
|
|
|
}
|
2008-04-23 07:29:19 +00:00
|
|
|
if(gs.lineSegments == 1 && gs.n == 1) {
|
|
|
|
c.entityA = gs.entity[0];
|
|
|
|
Entity *e = SS.GetEntity(c.entityA);
|
2008-04-27 03:26:27 +00:00
|
|
|
ha = e->point[0];
|
|
|
|
hb = e->point[1];
|
2008-04-23 07:29:19 +00:00
|
|
|
} else if(gs.points == 2 && gs.n == 2) {
|
|
|
|
ha = c.ptA = gs.point[0];
|
|
|
|
hb = c.ptB = gs.point[1];
|
|
|
|
} else {
|
|
|
|
Error("Bad selection for horizontal / vertical constraint.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(id == GraphicsWindow::MNU_HORIZONTAL) {
|
|
|
|
c.type = HORIZONTAL;
|
|
|
|
} else {
|
|
|
|
c.type = VERTICAL;
|
|
|
|
}
|
|
|
|
AddConstraint(&c);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2008-04-20 11:35:10 +00:00
|
|
|
case GraphicsWindow::MNU_SOLVE_NOW:
|
2008-04-27 09:03:01 +00:00
|
|
|
SS.GenerateAll(true);
|
2008-04-20 11:35:10 +00:00
|
|
|
return;
|
|
|
|
|
2008-04-27 05:00:12 +00:00
|
|
|
case GraphicsWindow::MNU_SOLVE_AUTO:
|
|
|
|
if(SS.GW.solving == GraphicsWindow::SOLVE_ALWAYS) {
|
|
|
|
SS.GW.solving = GraphicsWindow::DONT_SOLVE;
|
|
|
|
} else {
|
|
|
|
SS.GW.solving = GraphicsWindow::SOLVE_ALWAYS;
|
|
|
|
}
|
|
|
|
SS.GW.EnsureValidActives();
|
|
|
|
break;
|
|
|
|
|
2008-04-14 10:28:32 +00:00
|
|
|
default: oops();
|
|
|
|
}
|
|
|
|
|
|
|
|
SS.GW.ClearSelection();
|
|
|
|
InvalidateGraphics();
|
|
|
|
}
|
2008-04-20 11:35:10 +00:00
|
|
|
|
2008-04-30 08:14:32 +00:00
|
|
|
Expr *Constraint::VectorsParallel(int eq, ExprVector a, ExprVector b) {
|
|
|
|
ExprVector r = a.Cross(b);
|
|
|
|
// Hairy ball theorem screws me here. There's no clean solution that I
|
|
|
|
// know, so let's pivot on the initial numerical guess.
|
|
|
|
double mx = fabs((a.x)->Eval()) + fabs((b.x)->Eval());
|
|
|
|
double my = fabs((a.y)->Eval()) + fabs((b.y)->Eval());
|
|
|
|
double mz = fabs((a.z)->Eval()) + fabs((b.z)->Eval());
|
|
|
|
// The basis vector in which the vectors have the LEAST energy is the
|
|
|
|
// one that we should look at most (e.g. if both vectors lie in the xy
|
|
|
|
// plane, then the z component of the cross product is most important).
|
|
|
|
// So find the strongest component of a and b, and that's the component
|
|
|
|
// of the cross product to ignore.
|
|
|
|
double m = max(mx, max(my, mz));
|
|
|
|
Expr *e0, *e1;
|
|
|
|
if(m == mx) { e0 = r.y; e1 = r.z; }
|
|
|
|
else if(m == my) { e0 = r.z; e1 = r.x; }
|
|
|
|
else if(m == mz) { e0 = r.x; e1 = r.y; }
|
|
|
|
else oops();
|
|
|
|
|
|
|
|
if(eq == 0) return e0;
|
|
|
|
if(eq == 1) return e1;
|
|
|
|
oops();
|
|
|
|
}
|
|
|
|
|
2008-04-28 09:40:02 +00:00
|
|
|
Expr *Constraint::PointLineDistance(hEntity wrkpl, hEntity hpt, hEntity hln) {
|
|
|
|
Entity *ln = SS.GetEntity(hln);
|
|
|
|
Entity *a = SS.GetEntity(ln->point[0]);
|
|
|
|
Entity *b = SS.GetEntity(ln->point[1]);
|
|
|
|
|
|
|
|
Entity *p = SS.GetEntity(hpt);
|
|
|
|
|
|
|
|
if(wrkpl.v == Entity::FREE_IN_3D.v) {
|
|
|
|
ExprVector ep = p->PointGetExprs();
|
|
|
|
|
|
|
|
ExprVector ea = a->PointGetExprs();
|
|
|
|
ExprVector eb = b->PointGetExprs();
|
|
|
|
ExprVector eab = ea.Minus(eb);
|
|
|
|
Expr *m = eab.Magnitude();
|
|
|
|
|
|
|
|
return ((eab.Cross(ea.Minus(ep))).Magnitude())->Div(m);
|
|
|
|
} else {
|
|
|
|
Expr *ua, *va, *ub, *vb;
|
|
|
|
a->PointGetExprsInWorkplane(wrkpl, &ua, &va);
|
|
|
|
b->PointGetExprsInWorkplane(wrkpl, &ub, &vb);
|
|
|
|
|
|
|
|
Expr *du = ua->Minus(ub);
|
|
|
|
Expr *dv = va->Minus(vb);
|
|
|
|
|
|
|
|
Expr *u, *v;
|
|
|
|
p->PointGetExprsInWorkplane(wrkpl, &u, &v);
|
|
|
|
|
|
|
|
Expr *m = ((du->Square())->Plus(dv->Square()))->Sqrt();
|
|
|
|
|
|
|
|
Expr *proj = (dv->Times(ua->Minus(u)))->Minus(
|
|
|
|
(du->Times(va->Minus(v))));
|
|
|
|
|
|
|
|
return proj->Div(m);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-04-30 08:14:32 +00:00
|
|
|
Expr *Constraint::PointPlaneDistance(ExprVector p, hEntity hpl) {
|
|
|
|
ExprVector n;
|
|
|
|
Expr *d;
|
2008-05-05 11:17:00 +00:00
|
|
|
SS.GetEntity(hpl)->WorkplaneGetPlaneExprs(&n, &d);
|
2008-04-30 08:14:32 +00:00
|
|
|
return (p.Dot(n))->Minus(d);
|
|
|
|
}
|
|
|
|
|
2008-04-27 05:00:12 +00:00
|
|
|
Expr *Constraint::Distance(hEntity wrkpl, hEntity hpa, hEntity hpb) {
|
2008-04-20 11:35:10 +00:00
|
|
|
Entity *pa = SS.GetEntity(hpa);
|
|
|
|
Entity *pb = SS.GetEntity(hpb);
|
|
|
|
if(!(pa->IsPoint() && pb->IsPoint())) oops();
|
|
|
|
|
2008-04-27 05:00:12 +00:00
|
|
|
if(wrkpl.v == Entity::FREE_IN_3D.v) {
|
|
|
|
// This is true distance
|
|
|
|
ExprVector ea, eb, eab;
|
|
|
|
ea = pa->PointGetExprs();
|
|
|
|
eb = pb->PointGetExprs();
|
|
|
|
eab = ea.Minus(eb);
|
2008-04-20 11:35:10 +00:00
|
|
|
|
2008-04-27 05:00:12 +00:00
|
|
|
return eab.Magnitude();
|
|
|
|
} else {
|
|
|
|
// This is projected distance, in the given workplane.
|
|
|
|
Expr *au, *av, *bu, *bv;
|
|
|
|
|
|
|
|
pa->PointGetExprsInWorkplane(wrkpl, &au, &av);
|
|
|
|
pb->PointGetExprsInWorkplane(wrkpl, &bu, &bv);
|
2008-04-20 11:35:10 +00:00
|
|
|
|
2008-04-27 05:00:12 +00:00
|
|
|
Expr *du = au->Minus(bu);
|
|
|
|
Expr *dv = av->Minus(bv);
|
2008-04-20 11:35:10 +00:00
|
|
|
|
2008-04-27 05:00:12 +00:00
|
|
|
return ((du->Square())->Plus(dv->Square()))->Sqrt();
|
|
|
|
}
|
2008-04-20 11:35:10 +00:00
|
|
|
}
|
|
|
|
|
2008-05-01 06:53:50 +00:00
|
|
|
ExprVector Constraint::PointInThreeSpace(hEntity workplane, Expr *u, Expr *v) {
|
|
|
|
Entity *w = SS.GetEntity(workplane);
|
2008-05-05 11:17:00 +00:00
|
|
|
|
|
|
|
ExprVector ub = w->Normal()->NormalExprsU();
|
|
|
|
ExprVector vb = w->Normal()->NormalExprsV();
|
|
|
|
ExprVector ob = w->WorkplaneGetOffsetExprs();
|
2008-05-01 06:53:50 +00:00
|
|
|
|
|
|
|
return (ub.ScaledBy(u)).Plus(vb.ScaledBy(v)).Plus(ob);
|
|
|
|
}
|
|
|
|
|
2008-04-22 10:53:42 +00:00
|
|
|
void Constraint::ModifyToSatisfy(void) {
|
|
|
|
IdList<Equation,hEquation> l;
|
|
|
|
// An uninit IdList could lead us to free some random address, bad.
|
|
|
|
memset(&l, 0, sizeof(l));
|
|
|
|
|
|
|
|
Generate(&l);
|
|
|
|
if(l.n != 1) oops();
|
|
|
|
|
|
|
|
// These equations are written in the form f(...) - d = 0, where
|
|
|
|
// d is the value of the exprA.
|
|
|
|
double v = (l.elem[0].e)->Eval();
|
|
|
|
double nd = exprA->Eval() + v;
|
|
|
|
Expr::FreeKeep(&exprA);
|
|
|
|
exprA = Expr::FromConstant(nd)->DeepCopyKeep();
|
|
|
|
|
|
|
|
l.Clear();
|
|
|
|
}
|
|
|
|
|
2008-04-20 11:35:10 +00:00
|
|
|
void Constraint::AddEq(IdList<Equation,hEquation> *l, Expr *expr, int index) {
|
|
|
|
Equation eq;
|
|
|
|
eq.e = expr;
|
|
|
|
eq.h = h.equation(index);
|
|
|
|
l->Add(&eq);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Constraint::Generate(IdList<Equation,hEquation> *l) {
|
|
|
|
switch(type) {
|
|
|
|
case PT_PT_DISTANCE:
|
2008-04-27 05:00:12 +00:00
|
|
|
AddEq(l, Distance(workplane, ptA, ptB)->Minus(exprA), 0);
|
2008-04-20 11:35:10 +00:00
|
|
|
break;
|
|
|
|
|
2008-04-22 05:00:49 +00:00
|
|
|
case EQUAL_LENGTH_LINES: {
|
|
|
|
Entity *a = SS.GetEntity(entityA);
|
|
|
|
Entity *b = SS.GetEntity(entityB);
|
2008-04-27 05:00:12 +00:00
|
|
|
AddEq(l, Distance(workplane, a->point[0], a->point[1])->Minus(
|
|
|
|
Distance(workplane, b->point[0], b->point[1])), 0);
|
2008-04-22 05:00:49 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2008-04-21 08:16:38 +00:00
|
|
|
case POINTS_COINCIDENT: {
|
2008-04-22 13:14:15 +00:00
|
|
|
Entity *a = SS.GetEntity(ptA);
|
|
|
|
Entity *b = SS.GetEntity(ptB);
|
2008-04-27 05:00:12 +00:00
|
|
|
if(workplane.v == Entity::FREE_IN_3D.v) {
|
|
|
|
ExprVector pa = a->PointGetExprs();
|
|
|
|
ExprVector pb = b->PointGetExprs();
|
|
|
|
AddEq(l, pa.x->Minus(pb.x), 0);
|
|
|
|
AddEq(l, pa.y->Minus(pb.y), 1);
|
|
|
|
AddEq(l, pa.z->Minus(pb.z), 2);
|
2008-04-23 07:29:19 +00:00
|
|
|
} else {
|
2008-04-27 05:00:12 +00:00
|
|
|
Expr *au, *av;
|
|
|
|
Expr *bu, *bv;
|
|
|
|
a->PointGetExprsInWorkplane(workplane, &au, &av);
|
|
|
|
b->PointGetExprsInWorkplane(workplane, &bu, &bv);
|
|
|
|
AddEq(l, au->Minus(bu), 0);
|
|
|
|
AddEq(l, av->Minus(bv), 1);
|
2008-04-22 13:14:15 +00:00
|
|
|
}
|
2008-04-21 08:16:38 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2008-04-30 08:14:32 +00:00
|
|
|
case PT_IN_PLANE:
|
2008-04-27 05:00:12 +00:00
|
|
|
// This one works the same, whether projected or not.
|
2008-04-30 08:14:32 +00:00
|
|
|
AddEq(l, PointPlaneDistance(
|
|
|
|
SS.GetEntity(ptA)->PointGetExprs(), entityA), 0);
|
2008-04-21 08:16:38 +00:00
|
|
|
break;
|
|
|
|
|
2008-04-28 09:40:02 +00:00
|
|
|
case PT_ON_LINE:
|
|
|
|
if(workplane.v == Entity::FREE_IN_3D.v) {
|
|
|
|
Entity *ln = SS.GetEntity(entityA);
|
|
|
|
Entity *a = SS.GetEntity(ln->point[0]);
|
|
|
|
Entity *b = SS.GetEntity(ln->point[1]);
|
|
|
|
Entity *p = SS.GetEntity(ptA);
|
|
|
|
|
|
|
|
ExprVector ep = p->PointGetExprs();
|
|
|
|
ExprVector ea = a->PointGetExprs();
|
|
|
|
ExprVector eb = b->PointGetExprs();
|
|
|
|
ExprVector eab = ea.Minus(eb);
|
2008-04-30 08:14:32 +00:00
|
|
|
ExprVector eap = ea.Minus(ep);
|
|
|
|
|
|
|
|
AddEq(l, VectorsParallel(0, eab, eap), 0);
|
|
|
|
AddEq(l, VectorsParallel(1, eab, eap), 1);
|
2008-04-28 09:40:02 +00:00
|
|
|
} else {
|
|
|
|
AddEq(l, PointLineDistance(workplane, ptA, entityA), 0);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2008-04-30 08:14:32 +00:00
|
|
|
case AT_MIDPOINT:
|
|
|
|
if(workplane.v == Entity::FREE_IN_3D.v) {
|
|
|
|
Entity *ln = SS.GetEntity(entityA);
|
|
|
|
ExprVector a = SS.GetEntity(ln->point[0])->PointGetExprs();
|
|
|
|
ExprVector b = SS.GetEntity(ln->point[1])->PointGetExprs();
|
|
|
|
ExprVector m = (a.Plus(b)).ScaledBy(Expr::FromConstant(0.5));
|
|
|
|
|
2008-05-01 06:53:50 +00:00
|
|
|
if(ptA.v) {
|
|
|
|
ExprVector p = SS.GetEntity(ptA)->PointGetExprs();
|
|
|
|
AddEq(l, (m.x)->Minus(p.x), 0);
|
|
|
|
AddEq(l, (m.y)->Minus(p.y), 1);
|
|
|
|
AddEq(l, (m.z)->Minus(p.z), 2);
|
|
|
|
} else {
|
|
|
|
AddEq(l, PointPlaneDistance(m, entityB), 0);
|
|
|
|
}
|
2008-04-30 08:14:32 +00:00
|
|
|
} else {
|
|
|
|
Entity *ln = SS.GetEntity(entityA);
|
|
|
|
Entity *a = SS.GetEntity(ln->point[0]);
|
|
|
|
Entity *b = SS.GetEntity(ln->point[1]);
|
|
|
|
|
|
|
|
Expr *au, *av, *bu, *bv;
|
|
|
|
a->PointGetExprsInWorkplane(workplane, &au, &av);
|
|
|
|
b->PointGetExprsInWorkplane(workplane, &bu, &bv);
|
|
|
|
Expr *mu = Expr::FromConstant(0.5)->Times(au->Plus(bu));
|
|
|
|
Expr *mv = Expr::FromConstant(0.5)->Times(av->Plus(bv));
|
|
|
|
|
2008-05-01 06:53:50 +00:00
|
|
|
if(ptA.v) {
|
|
|
|
Entity *p = SS.GetEntity(ptA);
|
|
|
|
Expr *pu, *pv;
|
|
|
|
p->PointGetExprsInWorkplane(workplane, &pu, &pv);
|
|
|
|
AddEq(l, pu->Minus(mu), 0);
|
|
|
|
AddEq(l, pv->Minus(mv), 1);
|
|
|
|
} else {
|
|
|
|
ExprVector m = PointInThreeSpace(workplane, mu, mv);
|
|
|
|
AddEq(l, PointPlaneDistance(m, entityB), 0);
|
|
|
|
}
|
2008-04-30 08:14:32 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SYMMETRIC:
|
|
|
|
if(workplane.v == Entity::FREE_IN_3D.v) {
|
|
|
|
Entity *plane = SS.GetEntity(entityA);
|
|
|
|
Entity *ea = SS.GetEntity(ptA);
|
|
|
|
Entity *eb = SS.GetEntity(ptB);
|
|
|
|
ExprVector a = ea->PointGetExprs();
|
|
|
|
ExprVector b = eb->PointGetExprs();
|
|
|
|
|
|
|
|
// The midpoint of the line connecting the symmetric points
|
|
|
|
// lies on the plane of the symmetry.
|
|
|
|
ExprVector m = (a.Plus(b)).ScaledBy(Expr::FromConstant(0.5));
|
|
|
|
AddEq(l, PointPlaneDistance(m, plane->h), 0);
|
|
|
|
|
|
|
|
// And projected into the plane of symmetry, the points are
|
|
|
|
// coincident.
|
|
|
|
Expr *au, *av, *bu, *bv;
|
|
|
|
ea->PointGetExprsInWorkplane(plane->h, &au, &av);
|
|
|
|
eb->PointGetExprsInWorkplane(plane->h, &bu, &bv);
|
|
|
|
AddEq(l, au->Minus(bu), 0);
|
|
|
|
AddEq(l, av->Minus(bv), 1);
|
|
|
|
} else {
|
|
|
|
Entity *plane = SS.GetEntity(entityA);
|
|
|
|
Entity *a = SS.GetEntity(ptA);
|
|
|
|
Entity *b = SS.GetEntity(ptB);
|
|
|
|
|
|
|
|
Expr *au, *av, *bu, *bv;
|
|
|
|
a->PointGetExprsInWorkplane(workplane, &au, &av);
|
|
|
|
b->PointGetExprsInWorkplane(workplane, &bu, &bv);
|
|
|
|
Expr *mu = Expr::FromConstant(0.5)->Times(au->Plus(bu));
|
|
|
|
Expr *mv = Expr::FromConstant(0.5)->Times(av->Plus(bv));
|
|
|
|
|
2008-05-01 06:53:50 +00:00
|
|
|
ExprVector m = PointInThreeSpace(workplane, mu, mv);
|
|
|
|
AddEq(l, PointPlaneDistance(m, plane->h), 0);
|
2008-04-30 08:14:32 +00:00
|
|
|
|
|
|
|
// Construct a vector within the workplane that is normal
|
|
|
|
// to the symmetry pane's normal (i.e., that lies in the
|
|
|
|
// plane of symmetry). The line connecting the points is
|
|
|
|
// perpendicular to that constructed vector.
|
2008-05-01 06:53:50 +00:00
|
|
|
Entity *w = SS.GetEntity(workplane);
|
2008-05-05 11:17:00 +00:00
|
|
|
ExprVector u = w->Normal()->NormalExprsU();
|
|
|
|
ExprVector v = w->Normal()->NormalExprsV();
|
2008-05-01 06:53:50 +00:00
|
|
|
|
2008-04-30 08:14:32 +00:00
|
|
|
ExprVector pa = a->PointGetExprs();
|
|
|
|
ExprVector pb = b->PointGetExprs();
|
|
|
|
ExprVector n;
|
|
|
|
Expr *d;
|
2008-05-05 11:17:00 +00:00
|
|
|
plane->WorkplaneGetPlaneExprs(&n, &d);
|
2008-04-30 08:14:32 +00:00
|
|
|
AddEq(l, (n.Cross(u.Cross(v))).Dot(pa.Minus(pb)), 1);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2008-04-23 07:29:19 +00:00
|
|
|
case HORIZONTAL:
|
|
|
|
case VERTICAL: {
|
|
|
|
hEntity ha, hb;
|
|
|
|
if(entityA.v) {
|
|
|
|
Entity *e = SS.GetEntity(entityA);
|
2008-04-27 03:26:27 +00:00
|
|
|
ha = e->point[0];
|
|
|
|
hb = e->point[1];
|
2008-04-23 07:29:19 +00:00
|
|
|
} else {
|
|
|
|
ha = ptA;
|
|
|
|
hb = ptB;
|
|
|
|
}
|
|
|
|
Entity *a = SS.GetEntity(ha);
|
|
|
|
Entity *b = SS.GetEntity(hb);
|
2008-04-27 05:00:12 +00:00
|
|
|
|
|
|
|
Expr *au, *av, *bu, *bv;
|
|
|
|
a->PointGetExprsInWorkplane(workplane, &au, &av);
|
|
|
|
b->PointGetExprsInWorkplane(workplane, &bu, &bv);
|
|
|
|
|
|
|
|
AddEq(l, (type == HORIZONTAL) ? av->Minus(bv) : au->Minus(bu), 0);
|
2008-04-23 07:29:19 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2008-04-20 11:35:10 +00:00
|
|
|
default: oops();
|
|
|
|
}
|
|
|
|
}
|