Antkeeper  0.0.1
marching-cubes.hpp
Go to the documentation of this file.
1 /*
2  * Copyright (C) 2023 Christopher J. Howard
3  *
4  * This file is part of Antkeeper source code.
5  *
6  * Antkeeper source code is free software: you can redistribute it and/or modify
7  * it under the terms of the GNU General Public License as published by
8  * the Free Software Foundation, either version 3 of the License, or
9  * (at your option) any later version.
10  *
11  * Antkeeper source code is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14  * GNU General Public License for more details.
15  *
16  * You should have received a copy of the GNU General Public License
17  * along with Antkeeper source code. If not, see <http://www.gnu.org/licenses/>.
18  */
19 
20 #ifndef ANTKEEPER_GEOM_MARCHING_CUBES_HPP
21 #define ANTKEEPER_GEOM_MARCHING_CUBES_HPP
22 
23 #include <cstdint>
24 
25 namespace geom {
26 
28 namespace mc {
29 
38 void polygonize(float* vertices, std::uint8_t* vertex_count, std::int8_t* triangles, std::uint8_t* triangle_count, const float* corners, const float* distances);
39 
43 constexpr float unit_cube[8][3] =
44 {
45  {0, 0, 0},
46  {1, 0, 0},
47  {1, 1, 0},
48  {0, 1, 0},
49  {0, 0, 1},
50  {1, 0, 1},
51  {1, 1, 1},
52  {0, 1, 1}
53 };
54 
55 } // namespace mc
56 } // namespace geom
57 
58 #endif // ANTKEEPER_GEOM_MARCHING_CUBES_HPP
void polygonize(float *vertices, std::uint8_t *vertex_count, std::int8_t *triangles, std::uint8_t *triangle_count, const float *corners, const float *distances)
Uses the marching cubes algorithm to polygonize a single cell.
constexpr float unit_cube[8][3]
Vertices of a unit cube.
Geometric algorithms.