DrawingTool/PossibleSurfaces.cpp at master · CodeOx/DrawingTool · GitHub

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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include "ThreeDModelGenerator.h"
//#include "checkEqualPoints1.h"
#include <vector>

bool checkEqualPoints1(Point p1, Point p2){
	if(p1.getX() == p2.getX() && p1.getY() == p2.getY() && p1.getZ() == p2.getZ()){
		return true;
	}
	return false;
}


Point crossProduct(Point p1, Point p2){
	Point p;
	p.setX((p1.getY()*p2.getZ()) - (p1.getZ()*p2.getY()));
	p.setY((p1.getX()*p2.getZ()) - (p1.getZ()*p2.getX()));
	p.setZ((p1.getX()*p2.getY()) - (p1.getY()*p2.getX()));

	return p;
}

bool checkEqualLines(Line l1, Line l2){
	if(checkEqualPoints1(l1.getFirstPoint(), l2.getFirstPoint()) && checkEqualPoints1(l1.getSecondPoint(), l2.getSecondPoint())){
		return true;
	}
	return false;
}

bool checkIntersecting(Line l1, Line l2){
	if(checkEqualPoints1(l1.getFirstPoint(), l2.getFirstPoint()))
		return true;
	if(checkEqualPoints1(l1.getFirstPoint(), l2.getSecondPoint()))
		return true;
	if(checkEqualPoints1(l1.getSecondPoint(), l2.getFirstPoint()))
		return true;
	if(checkEqualPoints1(l1.getSecondPoint(), l2.getSecondPoint()))
		return true;

	return false;
}

Plane getPlane(Line l1, Line l2){
	Plane p;

	Point p1 = l1.getFirstPoint();
	Point p2 = l1.getSecondPoint();
	Point p3;
	if(checkEqualPoints1(p1, l2.getFirstPoint())){
		p3 = l2.getSecondPoint();
	}
	else{
		p3 = l2.getFirstPoint();
	}

	Point p4 = crossProduct(p1,p2);
	p.setA(p4.getX());
	p.setB(p4.getY());
	p.setC(p4.getZ());

	float negD = (p4.getX()*p3.getX()) + (p4.getY()*p3.getY()) + (p4.getZ()*p3.getZ());
	p.setD((-1)*negD);

	return p;
}

bool checkEqualPlanes(Plane p1, Plane p2){
	float ratio1 = p1.getA()/p2.getA();
	float ratio2 = p1.getB()/p2.getB();
	float ratio3 = p1.getC()/p2.getC();
	float ratio4 = p1.getD()/p2.getD();

	if(ratio1 == ratio2 && ratio1 == ratio3 && ratio1 == ratio4){
		return true;
	}

	return false;
}

PlaneWithLines* planeWithLinesListContains(Plane p, PlaneWithLines* plwithln, int size){

	for(int i = 0; i< size; i++){
		if(checkEqualPlanes(p, (*plwithln).getPlane())){
			return plwithln;
		}
	}

	return nullptr;
}

bool lineListContains(Line l, Line* lineList, int size){
	for(int i = 0; i < size; i++){
		if(checkEqualLines(l, *lineList)){
			return true;
		}
	}
	return false;
}

planeWithLinesList ThreeDModelGenerator::PossibleSurfacesConstructor(){
	Line* lines = possibleEdges.getLines();
	int numLines = possibleEdges.getSize();

	std::vector<PlaneWithLines> list;

	for(int i = 0; i < numLines-1; i++){

		Line* tempLines = lines+1;

		for(int j = 1; j < numLines; j++){

			if(checkIntersecting(*lines, *tempLines)){
				Plane p = getPlane(*lines, *tempLines);
				PlaneWithLines* originalPlane = planeWithLinesListContains(p,&list[0],list.size());

				if(originalPlane == nullptr){
					PlaneWithLines newPlaneWithLines;
					newPlaneWithLines.setPlane(p);
					newPlaneWithLines.addLine(*lines);
					newPlaneWithLines.addLine(*tempLines);
					list.push_back(newPlaneWithLines);
				}
				else{
					if(!lineListContains(*tempLines, (*originalPlane).getArrayLines(), (*originalPlane).getNumLines()))
						(*originalPlane).addLine(*tempLines);
					if(!lineListContains(*lines, (*originalPlane).getArrayLines(), (*originalPlane).getNumLines()))
						(*originalPlane).addLine(*lines);
				}

			}

			tempLines++;

		}

		lines++;
	}

	planeWithLinesList arr;
	arr.setPlaneWithLines(&list[0]);
	arr.setSize(list.size());

	return arr;
}