-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPolygon.cs
More file actions
75 lines (58 loc) · 1.37 KB
/
Polygon.cs
File metadata and controls
75 lines (58 loc) · 1.37 KB
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
66
67
68
69
70
71
72
73
74
using System;
using System.Collections.Generic;
using System.Text;
using System.Drawing;
namespace PolygonIntersection {
public class Polygon {
private readonly List<Vector> points = new List<Vector>();
private readonly List<Vector> edges = new List<Vector>();
public void BuildEdges() {
Vector p1;
Vector p2;
edges.Clear();
for (int i = 0; i < points.Count; i++) {
p1 = points[i];
if (i + 1 >= points.Count) {
p2 = points[0];
} else {
p2 = points[i + 1];
}
edges.Add(p2 - p1);
}
}
public List<Vector> Edges {
get { return edges; }
}
public List<Vector> Points {
get { return points; }
}
public Vector Center {
get {
float totalX = 0;
float totalY = 0;
for (int i = 0; i < points.Count; i++) {
totalX += points[i].X;
totalY += points[i].Y;
}
return new Vector(totalX / (float)points.Count, totalY / (float)points.Count);
}
}
public void Offset(Vector v) {
Offset(v.X, v.Y);
}
public void Offset(float x, float y) {
for (int i = 0; i < points.Count; i++) {
Vector p = points[i];
points[i] = new Vector(p.X + x, p.Y + y);
}
}
public override string ToString() {
string result = "";
for (int i = 0; i < points.Count; i++) {
if (result != "") result += " ";
result += "{" + points[i].ToString(true) + "}";
}
return result;
}
}
}