forked from Dan-Piker/K2Goals
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCoLinear.cs
65 lines (57 loc) · 1.51 KB
/
CoLinear.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using Rhino.Geometry;
namespace KangarooSolver.Goals
{
public class CoLinear : GoalObject
{
public double Strength;
public double TargetArea;
public CoLinear()
{
}
public CoLinear(List<int> V, double k)
{
int L = V.Count;
PIndex = V.ToArray();
Move = new Vector3d[L];
Weighting = new double[L];
for (int i = 0; i < L; i++)
{
Weighting[i] = k;
}
Strength = k;
}
public CoLinear(List<Point3d> V, 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;
}
Strength = k;
}
public override void Calculate(List<KangarooSolver.Particle> p)
{
int L = PIndex.Length;
Point3d[] Pts = new Point3d[L];
for (int i = 0; i < L; i++)
{
Pts[i] = p[PIndex[i]].Position;
}
Line Ln;
Line.TryFitLineToPoints(Pts, out Ln);
for (int i = 0; i < L; i++)
{
Move[i] = Ln.ClosestPoint((Pts[i]), false) - Pts[i];
Weighting[i] = Strength;
}
}
}
}