Antkeeper  0.0.1
bvh-node.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_BVH_NODE_HPP
21 #define ANTKEEPER_GEOM_BVH_NODE_HPP
22 
24 #include <cstdint>
25 
26 namespace geom {
27 
31 struct bvh_node
32 {
34  [[nodiscard]] inline constexpr bool is_leaf() const noexcept
35  {
36  return size;
37  }
38 
41 
43  std::uint32_t size;
44 
46  std::uint32_t offset;
47 };
48 
49 } // namespace geom
50 
51 #endif // ANTKEEPER_GEOM_BVH_NODE_HPP
Geometric algorithms.
Single node in a bounding volume hierarchy.
Definition: bvh-node.hpp:32
std::uint32_t offset
Offset to the first child node (non-leaf) or primitive (leaf).
Definition: bvh-node.hpp:46
std::uint32_t size
Number of primitives in the node.
Definition: bvh-node.hpp:43
constexpr bool is_leaf() const noexcept
Returns true if the node is a leaf node, false otherwise.
Definition: bvh-node.hpp:34
geom::box< float > bounds
Node bounds.
Definition: bvh-node.hpp:40
n-dimensional axis-aligned rectangle.