forked from Dan-Piker/K2Goals
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCurve2dPoint.cs
49 lines (46 loc) · 1.44 KB
/
Curve2dPoint.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
using System;
using System.Collections.Generic;
using Rhino.Geometry;
namespace KangarooSolver.Goals
{
/// <summary>
/// Collisions keeping points inside or outside a closed 2d curve in plane
/// </summary>
public class Curve2dPoint : GoalObject
{
public double Strength;
public Plane Pln;
public Curve C;
public bool Interior;
public Curve2dPoint(List<Point3d> V, Curve Crv, Plane Pln,bool interior, double k)
{
int L = V.Count;
PPos = V.ToArray();
Move = new Vector3d[L];
Weighting = new double[L];
for (int i = 0; i < L; i++)
{
Weighting[i] = k;
}
C = Crv;
this.Pln = Pln;
Interior = interior;
Strength = k;
}
public override void Calculate(List<KangarooSolver.Particle> p)
{
for (int i = 0; i < PIndex.Length; i++)
{
Point3d ThisPt = p[PIndex[i]].Position;
if (Interior != (C.Contains(ThisPt, Pln) == PointContainment.Inside))
{
double t = new double();
C.ClosestPoint(ThisPt, out t);
Move[i] = C.PointAt(t) - ThisPt;
Weighting[i] = Strength;
}
else { Move[i] = Vector3d.Zero; Weighting[i] = 0; }
}
}
}
}