-
Notifications
You must be signed in to change notification settings - Fork 1
/
geometry_triangle.cpp
204 lines (163 loc) · 5.86 KB
/
geometry_triangle.cpp
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
/*
* Quadrature and discretization for triangle in 2D.
*
* copyright@ Yimin Zhong <yzhong@math.utexas.edu>. All Rights Reserved.
*
*
* 1. volumetric discretization with triangle cells.
* 2. high order quadrature rules. (Rokhlin or Gimbatus).
*
*/
#include "geometry_triangle.h"
geometry_triangle::geometry_triangle() {
/*
* initialize all information on meta.
*
* primitive types.
*/
_meta.numberoftriangles = 0;
_meta.numberofpointattributes = 0;
_meta.numberofsegments = 0;
_meta.numberoftriangleattributes = 0;
_meta.numberofcorners = 0;
_meta.numberofregions = 0;
_meta.numberofedges = 0;
_meta.numberofholes = 0;
_meta.numberofpoints = 0;
/*
* initialize all pointers.
*/
_meta.pointlist = nullptr;
_meta.pointattributelist = nullptr;
_meta.pointmarkerlist = nullptr;
_meta.trianglelist = nullptr;
_meta.triangleattributelist = nullptr;
_meta.trianglearealist = nullptr;
_meta.segmentlist = nullptr;
_meta.segmentmarkerlist = nullptr;
_meta.edgelist = nullptr;
_meta.edgemarkerlist = nullptr;
_meta.regionlist = nullptr;
_meta.holelist = nullptr;
_meta.normlist = nullptr;
_meta.neighborlist = nullptr;
}
geometry_triangle::~geometry_triangle() {
/*
* release all information of the pointers.
*
* todo: use unique_ptr to describe the mesh.
*/
trifree((void *) _meta.pointlist);
trifree((void *) _meta.pointattributelist);
trifree((void *) _meta.pointmarkerlist);
trifree((void *) _meta.trianglelist);
trifree((void *) _meta.triangleattributelist);
trifree((void *) _meta.segmentlist);
trifree((void *) _meta.segmentmarkerlist);;
trifree((void *) _meta.edgelist);
trifree((void *) _meta.edgemarkerlist);
trifree((void *) _meta.regionlist);
trifree((void *) _meta.holelist);
trifree((void *) _meta.normlist);
trifree((void *) _meta.neighborlist);
}
void geometry_triangle::set_points(Array<double> &_points) {
auto len = _points.get_size();
assert(len % 2 == 0);
_meta.pointlist = (double *) malloc(len * sizeof(double));
assert(_meta.pointlist != nullptr);
_meta.numberofpoints = (int) (len / 2);
memcpy(_meta.pointlist, _points.get_data(), len * sizeof(double));
}
void geometry_triangle::set_facets(Array<int> &_facets) {
auto len = _facets.get_size();
assert(len % 2 == 0);
_meta.segmentlist = (int *) malloc(len * sizeof(int));
assert(_meta.segmentlist != nullptr);
_meta.numberofsegments = (int) (len / 2);
memcpy(_meta.segmentlist, _facets.get_data(), len * sizeof(int));
}
void geometry_triangle::build(std::string switches, geometry_triangle &out) {
geometry_triangle vor;
triangulate((char *) switches.c_str(), &_meta, &out._meta, &vor._meta);
out.setProperty();
}
void geometry_triangle::refine(std::string switches, geometry_triangle &out) {
geometry_triangle vor;
triangulate((char *) switches.c_str(), &_meta, &out._meta, &vor._meta);
out.setProperty();
}
scalar_t geometry_triangle::getX(int index) {
assert(index >= 0 && index < numberofpoints);
return this->_meta.pointlist[2 * index];
}
scalar_t geometry_triangle::getY(int index) {
assert(index >= 0 && index < numberofpoints);
return this->_meta.pointlist[2 * index + 1];
}
scalar_t geometry_triangle::getArea(int index) {
int u = this->_meta.trianglelist[3 * index];
int v = this->_meta.trianglelist[3 * index + 1];
int w = this->_meta.trianglelist[3 * index + 2];
scalar_t det = ((this->_meta.pointlist[2 * v] - this->_meta.pointlist[2 * u]) *
(this->_meta.pointlist[2 * w + 1] - this->_meta.pointlist[2 * u + 1]) -
(this->_meta.pointlist[2 * v + 1] - this->_meta.pointlist[2 * u + 1]) *
(this->_meta.pointlist[2 * w] - this->_meta.pointlist[2 * u]));
assert(det > 0);
return det / 2.0;
}
int geometry_triangle::getTriangle(int index) {
return this->_meta.trianglelist[index];
}
scalar_t geometry_triangle::getDistance(int fromIndex, int toIndex) {
return sqrt(SQR(getX(fromIndex) - getX(toIndex) + SQR(getY(fromIndex) - getY(toIndex))));
}
void geometry_triangle::getNearField(vector<vector<int>> &near) {
near.clear();
near.resize((unsigned long) numberoftriangles);
assert(this->_meta.neighborlist != nullptr);
unordered_set<int> Hashset;
queue<int> Queue;
unordered_set<int> cur_triangle;
for (index_t id = 0; id < numberoftriangles; ++id) {
Hashset.clear();
cur_triangle.clear();
Queue.push(id);
for (int pid = 0; pid < 3; ++pid) {
cur_triangle.insert(getTriangle(3 * id + pid));
}
while (!Queue.empty()) {
int top = Queue.front();
Queue.pop();
if (Hashset.find(top) == Hashset.end()) {
Hashset.insert(top);
for (int nid = 0; nid < 3; ++nid) {
int neighbor = _meta.neighborlist[3 * top + nid];
if (neighbor != -1) {
// check if it is adjacent.
bool adj = false;
for (int pid = 0; pid < 3; ++pid) {
if (cur_triangle.find(getTriangle(3 * neighbor + pid)) != cur_triangle.end()) {
adj = true;
break;
}
}
if (adj) {
Queue.push(neighbor);
}
}
}
}
}
for (int neigh : Hashset) {
near[id].push_back(neigh);
}
}
}
void geometry_triangle::getAllArea() {
arealist.resize((unsigned long) numberoftriangles);
for (index_t id = 0; id < numberoftriangles; ++id) {
arealist[id] = getArea(id);
}
}