-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathVerifyPredicate.h
More file actions
95 lines (82 loc) · 3.77 KB
/
VerifyPredicate.h
File metadata and controls
95 lines (82 loc) · 3.77 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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include "Number.h"
#include "Point2D.h"
#include "Line2D.h"
#include "Region2D.h"
#include "PlaneSweep.h"
#include "ParallelObjTraversal.h"
#include <unordered_map>
class VerifyPredicate
{
private:
HalfSegment2D findHS(vector<HalfSegment2D> HS, SimplePoint2D point);
std::unordered_map<int, vector<bool>> predicates;
std::unordered_map<int, vector<bool>> pointPointPredicates;
std::unordered_map<int, vector<bool>> lineRegionPredicates;
std::unordered_map<int, vector<bool>> pointLinePredicates;
std::unordered_map<int, vector<bool>> pointRegionPredicates;
std::unordered_map<int, vector<bool>> regionRegionPredicates;
std::vector<bool> PointPointAlgorithm(Point2D p1, Point2D p2);
std::vector<bool> PointLineAlgorithm(Point2D obj1, Line2D obj2);
std::vector<bool> PointRegionAlgorithm(Point2D obj1, Region2D obj2);
std::vector<bool> LineLineAlgorithm(Line2D obj1, Line2D obj2);
std::vector<bool> LineRegionAlgorithm(Line2D obj1, Region2D obj2);
std::vector<bool> RegionRegionAlgorithm(Region2D f, Region2D g);
public:
VerifyPredicate();
// This function creates a features vector, then manipulates it in parallel object traversal
// It then evaluates that vector and returns true.
bool disjoint(Point2D obj1, Point2D obj2);
bool disjoint(Point2D obj1, Line2D obj2);
bool disjoint(Point2D obj1, Region2D obj2);
bool disjoint(Line2D obj1, Line2D obj2);
bool disjoint(Line2D obj1, Region2D obj2);
bool disjoint(Region2D obj1, Region2D obj2);
bool meet(Point2D obj1, Point2D obj2);
bool meet(Point2D obj1, Line2D obj2);
bool meet(Point2D obj1, Region2D obj2);
bool meet(Line2D obj1, Line2D obj2);
bool meet(Line2D obj1, Region2D obj2);
bool meet(Region2D obj1, Region2D obj2);
bool equal(Point2D obj1, Point2D obj2);
bool equal(Point2D obj1, Line2D obj2);
bool equal(Point2D obj1, Region2D obj2);
bool equal(Line2D obj1, Line2D obj2);
bool equal(Line2D obj1, Region2D obj2);
bool equal(Region2D obj1, Region2D obj2);
bool inside(Point2D obj1, Point2D obj2);
bool inside(Point2D obj1, Line2D obj2);
bool inside(Point2D obj1, Region2D obj2);
bool inside(Line2D obj1, Line2D obj2);
bool inside(Line2D obj1, Region2D obj2);
bool inside(Region2D obj1, Region2D obj2);
bool covered_by(Point2D obj1, Point2D obj2);
bool covered_by(Point2D obj1, Line2D obj2);
bool covered_by(Point2D obj1, Region2D obj2);
bool covered_by(Line2D obj1, Line2D obj2);
bool covered_by(Line2D obj1, Region2D obj2);
bool covered_by(Region2D obj1, Region2D obj2);
bool contains(Point2D obj1, Point2D obj2);
bool contains(Point2D obj1, Line2D obj2);
bool contains(Point2D obj1, Region2D obj2);
bool contains(Line2D obj1, Line2D obj2);
bool contains(Line2D obj1, Region2D obj2);
bool contains(Region2D obj1, Region2D obj2);
bool covers(Point2D obj1, Point2D obj2);
bool covers(Point2D obj1, Line2D obj2);
bool covers(Point2D obj1, Region2D obj2);
bool covers(Line2D obj1, Line2D obj2);
bool covers(Line2D obj1, Region2D obj2);
bool covers(Region2D obj1, Region2D obj2);
bool overlap(Point2D obj1, Point2D obj2);
bool overlap(Point2D obj1, Line2D obj2);
bool overlap(Point2D obj1, Region2D obj2);
bool overlap(Line2D obj1, Line2D obj2);
bool overlap(Line2D obj1, Region2D obj2);
bool overlap(Region2D obj1, Region2D obj2);
bool verify(Point2D obj1, Point2D obj2, int predicateNumber);
bool verify(Point2D obj1, Line2D obj2, int predicateNumber);
bool verify(Point2D obj1, Region2D obj2, int predicateNumber);
bool verify(Line2D obj1, Line2D obj2, int predicateNumber);
bool verify(Line2D obj1, Region2D obj2, int predicateNumber);
bool verify(Region2D obj1, Region2D obj2, int predicateNumber);
};