Repository navigation
Expand file tree
/
Copy pathmain.cpp
More file actions
160 lines (124 loc) · 4.58 KB
/
Copy pathmain.cpp
File metadata and controls
160 lines (124 loc) · 4.58 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
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
#include <string>
#include <iostream>
#include <fstream>
#include <ultimaille/all.h>
#include <OpenNL_psm/OpenNL_psm.h>
using namespace UM;
#define FOR(i, n) for(int i = 0; i < n; i++)
void soft_deformation(Triangles& m, FacetAttribute<int>& flag) {
auto begin = std::chrono::steady_clock::now();
auto context = nlNewContext();
nlSolverParameteri(NL_LEAST_SQUARES, NL_TRUE);
nlSolverParameteri(NL_NB_VARIABLES, NLint(3 * m.nverts()));
//nlEnable(NL_VERBOSE);
int N = m.nverts();
nlBegin(NL_SYSTEM);
nlBegin(NL_MATRIX);
FOR(f, m.nfacets()) {
int dim = flag[f] / 2;
vec3 n = Triangles::Facet(m,f).geom<Triangle3>().normal();
FOR(d, 3) {
FOR(fv, 3) {
nlRowScaling(std::sqrt(n.norm()));
nlBegin(NL_ROW);
nlCoefficient(d * N + m.vert(f, fv), 1);
nlCoefficient(d * N + m.vert(f, (fv + 1) % 3), -1);
if (d != dim) nlRightHandSide(m.points[m.vert(f, fv)][d] - m.points[m.vert(f, (fv + 1) % 3)][d]);
nlEnd(NL_ROW);
}
}
}
nlEnd(NL_MATRIX);
nlEnd(NL_SYSTEM);
auto buidlend = std::chrono::steady_clock::now();
nlSolve();
FOR(v, m.nverts()) FOR(d, 3) m.points[v][d] = nlGetVariable(d * N + v);
nlDeleteContext(context);
auto solveend = std::chrono::steady_clock::now();
double totaltime = double(std::chrono::duration_cast<std::chrono::milliseconds> (solveend - begin).count()) / 1000;
double buildtime = double(std::chrono::duration_cast<std::chrono::milliseconds> (buidlend - begin).count()) / 1000;
double solvetime = double(std::chrono::duration_cast<std::chrono::milliseconds> (solveend - buidlend).count()) / 1000;
std::cerr << "Running time: " << buildtime << " + " << solvetime << " = " << totaltime << "sec." << std::endl;
}
void hard_deformation(Triangles& m, FacetAttribute<int>& flag) {
int N = m.nverts();
auto begin = std::chrono::steady_clock::now();
auto context = nlNewContext();
DisjointSet ds(3 * m.nverts());
FOR(f, m.nfacets()) {
int dim = flag[f] / 2;
FOR(fv, 3) ds.merge(dim * N + m.vert(f, fv), dim * N + m.vert(f, (fv + 1) % 3));
}
std::vector<int> idmap;
int nb_variables = ds.get_sets_id(idmap);
nlSolverParameteri(NL_LEAST_SQUARES, NL_TRUE);
nlSolverParameteri(NL_NB_VARIABLES, NLint(nb_variables));
nlSolverParameteri(NL_PRECONDITIONER, NL_PRECOND_JACOBI);
nlBegin(NL_SYSTEM);
nlBegin(NL_MATRIX);
FOR(f, m.nfacets()) {
int dim = flag[f] / 2;
double parea = std::sqrt(Triangles::Facet(m,f).geom<Triangle3>().unsigned_area());
FOR(d, 3) {
if (dim == d) continue;
FOR(fv, 3) {
nlRowScaling(parea);
nlBegin(NL_ROW);
nlCoefficient(idmap[d * N + m.vert(f, fv)], 1);
nlCoefficient(idmap[d * N + m.vert(f, (fv + 1) % 3)], -1);
nlRightHandSide(m.points[m.vert(f, fv)][d] - m.points[m.vert(f, (fv + 1) % 3)][d]);
nlEnd(NL_ROW);
}
}
}
nlEnd(NL_MATRIX);
nlEnd(NL_SYSTEM);
auto buidlend = std::chrono::steady_clock::now();
nlSolve();
FOR(v, m.nverts()) FOR(d, 3) m.points[v][d] = nlGetVariable(idmap[d * N + v]);
nlDeleteContext(context);
auto solveend = std::chrono::steady_clock::now();
double totaltime = double(std::chrono::duration_cast<std::chrono::milliseconds> (solveend - begin).count()) / 1000;
double buildtime = double(std::chrono::duration_cast<std::chrono::milliseconds> (buidlend - begin).count()) / 1000;
double solvetime = double(std::chrono::duration_cast<std::chrono::milliseconds> (solveend - buidlend).count()) / 1000;
std::cerr << "Running time: " << buildtime << " + " << solvetime << " = " << totaltime << "sec." << std::endl;
}
void naive_flag_mesh(Triangles& m, FacetAttribute<int>& flags) {
const std::array<vec3, 6> AXES = { {{1.,0.,0.},{-1.,0.,0.},{0.,1.,0.},{0.,-1.,0.},{0.,0.,1.},{0.,0.,-1.}} };
FOR(f, m.nfacets()) {
vec3 n = Triangles::Facet(m,f).geom<Triangle3>().normal();
flags[f] = 0;
double best = AXES[0] * n;
FOR(i, 5) if (n * AXES[i + 1] > best) {
best = n * AXES[i + 1];
flags[f] = i + 1;
}
}
}
int main(int argc, char** argv) {
if (argc != 4) {
std::cout << "Usage is: " << argv[0] << " triangularmesh.ext flagfile deformedoutput.ext" << std::endl;
return 1;
}
std::string inputfile = argv[1];
std::string flagfile = argv[2];
std::string outputfile = argv[3];
Triangles m;
read_by_extension(inputfile, m);
m.delete_isolated_vertices();
FacetAttribute<int> flag(m, 0);
std::ifstream ifs(flagfile);
if (!ifs.is_open()) {
std::cerr << "Failed opening of flags at : " << flagfile << std::endl;
abort();
}
FOR(f, m.nfacets()) {
if (ifs.eof()) break;
ifs >> flag[f];
}
ifs.close();
write_by_extension("flagging.geogram", m, { {},{{"flag", flag.ptr}},{} });
hard_deformation(m, flag);
write_by_extension(outputfile, m);
return 0;
}