Relintai/fast_quadratic_mesh_simplifier
1
0
Fork 0
mirror of https://github.com/Relintai/fast_quadratic_mesh_simplifier.git synced 2024-11-12 08:35:03 +01:00
Code Issues Packages Projects Releases Wiki Activity

Started porting the improvements from https://github.com/Whinarn/MeshDecimator .

Browse Source
This commit is contained in:
Relintai 2020-03-29 17:56:57 +02:00
parent b7f189c88a
commit d58c1db5c6
1 changed files with 32 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
simplify.h
View File

@ -312,6 +312,11 @@ public:
};
///////////////////////////////////////////
struct BorderVertex {
int index;
int hash;
};
class FQMS {
public:
@ -331,6 +336,8 @@ public:
int tstart, tcount;
SymetricMatrix q;
int border;
bool seam;
bool foldover;
};
struct Ref {
@ -783,9 +790,17 @@ public:
std::vector<int> vcount, vids;
for (unsigned int i = 0; i < vertices.size(); ++i) {
vertices[i].border = 0;
Vertex &v = vertices[i];
v.border = 0;
v.seam = false;
v.foldover = false;
}
int border_vertex_count = 0;
double border_min_x = DBL_MIN;
double border_max_x = DBL_MAX;
for (unsigned int i = 0; i < vertices.size(); ++i) {
Vertex &v = vertices[i];
vcount.clear();
@ -817,9 +832,24 @@ public:
for (unsigned int j = 0; j < vcount.size(); ++j) {
if (vcount[j] == 1) {
vertices[vids[j]].border = 1;
Vertex &v = vertices[vids[j]];
v.border = 1;
++border_vertex_count;
if (_enable_smart_link) {
if (v.p.x < border_min_x)
border_min_x = v.p.x;
if (v.p.x < border_max_x)
border_max_x = v.p.x;
}
}
}
if (_enable_smart_link) {
//std::vector<BorderVertex> border_vertices;
}
}
}
}
@ -857,14 +887,10 @@ public:
for (unsigned int i = 0; i < triangles.size(); ++i) {
Triangle &t = triangles[i];
//ok
//print_error("b " + String::num(t.v[0]) + " " + String::num(t.v[1]) + " " + String::num(t.v[2]) + " ");
for (int j = 0; j < 3; ++j) {
t.v[j] = vertices[t.v[j]].tstart;
}
//print_error("a " + String::num(t.v[0]) + " " + String::num(t.v[1]) + " " + String::num(t.v[2]) + " ");
}
vertices.resize(dst);
}