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
|
//-----------------------------------------------------------------------------
// Name: halfedge.h
// Developer: Wolfire Games LLC
// Description:
// License: Read below
//-----------------------------------------------------------------------------
//
//
// Copyright 2022 Wolfire Games LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
//-----------------------------------------------------------------------------
#pragma once
#include <Math/enginemath.h>
#include <Math/mat4.h>
#include <Wrappers/glm.h>
#include <Graphics/simplify_types.h>
#include <vector>
#include <set>
struct HalfEdge;
struct HalfEdgeNode {
HalfEdge *edge;
};
typedef std::multiset<HalfEdgeNode> HalfEdgeNodeHeap;
struct HalfEdge {
int vert[2];
int tex[2];
float err;
float pos;
HalfEdge *twin, *next, *prev;
int id;
bool valid;
HalfEdgeNodeHeap::iterator handle;
};
struct EdgeSortable {
int verts[2];
int id;
};
struct VertSortable {
vec3 vert;
int id;
};
static const float UNDEFINED_ERROR = -1.0f;
bool operator<(const HalfEdgeNode& a, const HalfEdgeNode& b);
typedef std::set<HalfEdge*> HalfEdgeSet;
typedef std::vector<HalfEdgeSet> HalfEdgeSetVec;
bool HalfEdgePairFind(const HalfEdge& a, const HalfEdge& b);
void CollapseHalfEdge(HalfEdgeNodeHeap &heap, HalfEdge *edge);
void CollapseVertPositions(std::vector<float> &verts, int edge[], float pos);
void CollapseTexPositions(std::vector<float> &tex, int edge[], float pos);
int GetNumTexCoords(const HalfEdge *edge, int which);
void CollapseParentRecord(WOLFIRE_SIMPLIFY::ParentRecordList &a, WOLFIRE_SIMPLIFY::ParentRecordList &b, float weight);
void CollapseEdge(HalfEdgeNodeHeap &heap, HalfEdge *edge, std::vector<float>& vertices, std::vector<float>& tex_coords, std::vector<glm::mat4> &quadrics, WOLFIRE_SIMPLIFY::ParentRecordListVec &vert_parents, WOLFIRE_SIMPLIFY::ParentRecordListVec &tex_parents, HalfEdgeSetVec &vert_edges, HalfEdgeSetVec &tex_edges, bool include_tex);
void ReconstructModel(const std::vector<HalfEdge> &half_edges, WOLFIRE_SIMPLIFY::SimplifyModel *model, bool include_tex);
bool HalfEdgePairFind(const HalfEdge& a, const HalfEdge& b);
bool SortEdgeSortable(const EdgeSortable& a, const EdgeSortable& b);
bool SortVertSortable(const VertSortable& a, const VertSortable& b);
|
