forked from daviddoria/PoissonReconstruction
/
MarchingCubes.h
178 lines (115 loc) · 6.91 KB
/
MarchingCubes.h
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
/*=========================================================================
Authors: Michael Kazhdan and Matthew Bolitho
at Johns Hopkins University, 2006-10
Copyright (c) 2006-10, Michael Kazhdan and Matthew Bolitho,
Johns Hopkins University.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Neither the name of the Johns Hopkins University nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
=========================================================================*/
#ifndef MARCHING_CUBES_INCLUDED
#define MARCHING_CUBES_INCLUDED
#include <vector>
#include "Geometry.h"
class Square
{
public:
const static int CORNERS = 4, EDGES = 4, NEIGHBORS = 4;
static int CornerIndex(const int & x, const int & y);
static void FactorCornerIndex(const int & idx, int & x, int & y);
static int EdgeIndex(const int & orientation, const int & i);
static void FactorEdgeIndex(const int & idx, int & orientation, int & i);
static int ReflectCornerIndex(const int & idx, const int & edgeIndex);
static int ReflectEdgeIndex(const int & idx, const int & edgeIndex);
static void EdgeCorners(const int & idx, int & c1, int & c2);
};
class Cube
{
public:
const static int CORNERS = 8, EDGES = 12, NEIGHBORS = 6;
static int CornerIndex(const int & x, const int & y, const int & z);
static void FactorCornerIndex(const int & idx, int & x, int & y, int & z);
static int EdgeIndex(const int & orientation, const int & i, const int & j);
static void FactorEdgeIndex(const int & idx, int & orientation, int & i, int & j);
static int FaceIndex(const int & dir, const int & offSet);
static int FaceIndex(const int & x, const int & y, const int & z);
static void FactorFaceIndex(const int & idx, int & x, int & y, int & z);
static void FactorFaceIndex(const int & idx, int & dir, int & offSet);
static int AntipodalCornerIndex(const int & idx);
static int FaceReflectCornerIndex(const int & idx, const int & faceIndex);
static int FaceReflectEdgeIndex(const int & idx, const int & faceIndex);
static int FaceReflectFaceIndex(const int & idx, const int & faceIndex);
static int EdgeReflectCornerIndex(const int & idx, const int & edgeIndex);
static int EdgeReflectEdgeIndex(const int & edgeIndex);
static int FaceAdjacentToEdges(const int & eIndex1, const int & eIndex2);
static void FacesAdjacentToEdge(const int & eIndex, int & f1Index, int & f2Index);
static void EdgeCorners(const int & idx, int & c1, int & c2);
static void FaceCorners(const int & idx, int & c1, int & c2, int & c3, int & c4);
};
class MarchingSquares
{
static double Interpolate(const double & v1, const double & v2);
static void SetVertex(const int & e, const double values[Square::CORNERS], const double & iso);
public:
const static int MAX_EDGES = 2;
static const int edgeMask[1 << Square::CORNERS];
static const int edges[1 << Square::CORNERS][2 * MAX_EDGES + 1];
static double vertexList[Square::EDGES][2];
static int GetIndex(const double values[Square::CORNERS], const double & iso);
static int IsAmbiguous(const double v[Square::CORNERS], const double & isoValue);
static int AddEdges(const double v[Square::CORNERS], const double & isoValue, Edge *edges);
static int AddEdgeIndices(const double v[Square::CORNERS], const double & isoValue, int *edges);
};
class MarchingCubes
{
static double Interpolate(const double & v1, const double & v2);
static void SetVertex(const int & e, const double values[Cube::CORNERS], const double & iso);
static int GetFaceIndex(const double values[Cube::CORNERS], const double & iso, const int & faceIndex);
static float Interpolate(const float & v1, const float & v2);
static void SetVertex(const int & e, const float values[Cube::CORNERS], const float & iso);
static int GetFaceIndex(const float values[Cube::CORNERS], const float & iso, const int & faceIndex);
static int GetFaceIndex(const int & mcIndex, const int & faceIndex);
public:
const static int MAX_TRIANGLES = 5;
static const int edgeMask[1 << Cube::CORNERS];
static const int triangles[1 << Cube::CORNERS][3 * MAX_TRIANGLES + 1];
static const int cornerMap[Cube::CORNERS];
static double vertexList[Cube::EDGES][3];
static int AddTriangleIndices(const int & mcIndex, int *triangles);
static int GetIndex(const double values[Cube::CORNERS], const double & iso);
static int IsAmbiguous(const double v[Cube::CORNERS], const double & isoValue, const int & faceIndex);
static int HasRoots(const double v[Cube::CORNERS], const double & isoValue);
static int HasRoots(const double v[Cube::CORNERS], const double & isoValue, const int & faceIndex);
static int AddTriangles(const double v[Cube::CORNERS], const double & isoValue, Triangle *triangles);
static int AddTriangleIndices(const double v[Cube::CORNERS], const double & isoValue, int *triangles);
static int GetIndex(const float values[Cube::CORNERS], const float & iso);
static int IsAmbiguous(const float v[Cube::CORNERS], const float & isoValue, const int & faceIndex);
static int HasRoots(const float v[Cube::CORNERS], const float & isoValue);
static int HasRoots(const float v[Cube::CORNERS], const float & isoValue, const int & faceIndex);
static int AddTriangles(const float v[Cube::CORNERS], const float & isoValue, Triangle *triangles);
static int AddTriangleIndices(const float v[Cube::CORNERS], const float & isoValue, int *triangles);
static int IsAmbiguous(const int & mcIndex, const int & faceIndex);
static int HasRoots(const int & mcIndex);
static int HasFaceRoots(const int & mcIndex, const int & faceIndex);
static int HasEdgeRoots(const int & mcIndex, const int & edgeIndex);
};
#endif //MARCHING_CUBES_INCLUDED