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
|
#include "obj.h"
#include <algorithm>
#include <gfx/models/mesh.h> // IWYU pragma: keep
#include <gfx/models/vertex.hpp>
#include <glm/glm.hpp>
#include <iterator>
#include <memory>
#include <utility>
#include <vector>
std::vector<ObjParser::NamedMesh>
ObjParser::createMeshes() const
{
std::vector<ObjParser::NamedMesh> out;
const auto data {createMeshData()};
std::transform(data.begin(), data.end(), std::back_inserter(out), [](auto && obj) {
return std::make_pair(obj.first, std::make_shared<Mesh>(obj.second.first, obj.second.second));
});
return out;
}
std::vector<ObjParser::NamedMeshData>
ObjParser::createMeshData() const
{
std::vector<ObjParser::NamedMeshData> out;
out.reserve(objects.size());
std::transform(objects.begin(), objects.end(), std::back_inserter(out), [this](auto && obj) {
std::vector<Vertex> overtices;
std::vector<ObjParser::FaceElement> vertexOrder;
std::vector<unsigned int> indices;
for (const auto & face : obj.second) {
for (auto idx = 2U; idx < face.size(); idx += 1) {
auto f = [&](auto idx) {
const auto & fe {face[idx]};
if (const auto existing = std::find(vertexOrder.begin(), vertexOrder.end(), fe);
existing != vertexOrder.end()) {
indices.push_back(std::distance(vertexOrder.begin(), existing));
}
else {
indices.push_back(overtices.size());
overtices.emplace_back(vertices[fe.x - 1], texCoords[fe.y - 1], -normals[fe.z - 1]);
vertexOrder.emplace_back(fe);
}
};
f(0);
f(idx);
f(idx - 1);
}
}
return std::make_pair(obj.first, std::make_pair(overtices, indices));
});
return out;
}
|
