2011-04-27 11:58:34 +00:00
|
|
|
/*
|
|
|
|
* Adapted from code copyright 2009-2010 NVIDIA Corporation
|
|
|
|
* Modifications Copyright 2011, Blender Foundation.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __BVH_H__
|
|
|
|
#define __BVH_H__
|
|
|
|
|
Cycles: Make all #include statements relative to cycles source directory
The idea is to make include statements more explicit and obvious where the
file is coming from, additionally reducing chance of wrong header being
picked up.
For example, it was not obvious whether bvh.h was refferring to builder
or traversal, whenter node.h is a generic graph node or a shader node
and cases like that.
Surely this might look obvious for the active developers, but after some
time of not touching the code it becomes less obvious where file is coming
from.
This was briefly mentioned in T50824 and seems @brecht is fine with such
explicitness, but need to agree with all active developers before committing
this.
Please note that this patch is lacking changes related on GPU/OpenCL
support. This will be solved if/when we all agree this is a good idea to move
forward.
Reviewers: brecht, lukasstockner97, maiself, nirved, dingto, juicyfruit, swerner
Reviewed By: lukasstockner97, maiself, nirved, dingto
Subscribers: brecht
Differential Revision: https://developer.blender.org/D2586
2017-03-28 18:39:14 +00:00
|
|
|
#include "bvh/bvh_params.h"
|
2018-11-09 10:54:24 +00:00
|
|
|
#include "util/util_array.h"
|
Cycles: Make all #include statements relative to cycles source directory
The idea is to make include statements more explicit and obvious where the
file is coming from, additionally reducing chance of wrong header being
picked up.
For example, it was not obvious whether bvh.h was refferring to builder
or traversal, whenter node.h is a generic graph node or a shader node
and cases like that.
Surely this might look obvious for the active developers, but after some
time of not touching the code it becomes less obvious where file is coming
from.
This was briefly mentioned in T50824 and seems @brecht is fine with such
explicitness, but need to agree with all active developers before committing
this.
Please note that this patch is lacking changes related on GPU/OpenCL
support. This will be solved if/when we all agree this is a good idea to move
forward.
Reviewers: brecht, lukasstockner97, maiself, nirved, dingto, juicyfruit, swerner
Reviewed By: lukasstockner97, maiself, nirved, dingto
Subscribers: brecht
Differential Revision: https://developer.blender.org/D2586
2017-03-28 18:39:14 +00:00
|
|
|
#include "util/util_types.h"
|
|
|
|
#include "util/util_vector.h"
|
2011-04-27 11:58:34 +00:00
|
|
|
|
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
|
2018-11-07 11:58:12 +00:00
|
|
|
class Stats;
|
2011-04-27 11:58:34 +00:00
|
|
|
class BVHNode;
|
2011-05-03 18:29:11 +00:00
|
|
|
struct BVHStackEntry;
|
2011-04-27 11:58:34 +00:00
|
|
|
class BVHParams;
|
|
|
|
class BoundBox;
|
|
|
|
class LeafNode;
|
|
|
|
class Object;
|
|
|
|
class Progress;
|
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
#define BVH_ALIGN 4096
|
2017-04-13 08:55:46 +00:00
|
|
|
#define TRI_NODE_SIZE 3
|
2011-04-27 11:58:34 +00:00
|
|
|
/* Packed BVH
|
|
|
|
*
|
|
|
|
* BVH stored as it will be used for traversal on the rendering device. */
|
|
|
|
|
|
|
|
struct PackedBVH {
|
2019-04-17 04:17:24 +00:00
|
|
|
/* BVH nodes storage, one node is 4x int4, and contains two bounding boxes,
|
|
|
|
* and child, triangle or object indexes depending on the node type */
|
|
|
|
array<int4> nodes;
|
|
|
|
/* BVH leaf nodes storage. */
|
|
|
|
array<int4> leaf_nodes;
|
|
|
|
/* object index to BVH node index mapping for instances */
|
|
|
|
array<int> object_node;
|
|
|
|
/* Mapping from primitive index to index in triangle array. */
|
|
|
|
array<uint> prim_tri_index;
|
|
|
|
/* Continuous storage of triangle vertices. */
|
|
|
|
array<float4> prim_tri_verts;
|
|
|
|
/* primitive type - triangle or strand */
|
|
|
|
array<int> prim_type;
|
|
|
|
/* visibility visibilitys for primitives */
|
|
|
|
array<uint> prim_visibility;
|
|
|
|
/* mapping from BVH primitive index to true primitive index, as primitives
|
|
|
|
* may be duplicated due to spatial splits. -1 for instances. */
|
|
|
|
array<int> prim_index;
|
|
|
|
/* mapping from BVH primitive index, to the object id of that primitive. */
|
|
|
|
array<int> prim_object;
|
|
|
|
/* Time range of BVH primitive. */
|
|
|
|
array<float2> prim_time;
|
|
|
|
|
|
|
|
/* index of the root node. */
|
|
|
|
int root_index;
|
|
|
|
|
|
|
|
PackedBVH()
|
|
|
|
{
|
|
|
|
root_index = 0;
|
|
|
|
}
|
2011-04-27 11:58:34 +00:00
|
|
|
};
|
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
enum BVH_TYPE { bvh2, bvh4, bvh8 };
|
2018-02-14 10:23:30 +00:00
|
|
|
|
2011-04-27 11:58:34 +00:00
|
|
|
/* BVH */
|
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
class BVH {
|
|
|
|
public:
|
|
|
|
PackedBVH pack;
|
|
|
|
BVHParams params;
|
|
|
|
vector<Object *> objects;
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
static BVH *create(const BVHParams ¶ms, const vector<Object *> &objects);
|
|
|
|
virtual ~BVH()
|
|
|
|
{
|
|
|
|
}
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
virtual void build(Progress &progress, Stats *stats = NULL);
|
|
|
|
void refit(Progress &progress);
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
protected:
|
|
|
|
BVH(const BVHParams ¶ms, const vector<Object *> &objects);
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
/* Refit range of primitives. */
|
|
|
|
void refit_primitives(int start, int end, BoundBox &bbox, uint &visibility);
|
2017-10-13 17:36:10 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
/* triangles and strands */
|
|
|
|
void pack_primitives();
|
|
|
|
void pack_triangle(int idx, float4 storage[3]);
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
/* merge instance BVH's */
|
|
|
|
void pack_instances(size_t nodes_size, size_t leaf_nodes_size);
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
/* for subclasses to implement */
|
|
|
|
virtual void pack_nodes(const BVHNode *root) = 0;
|
|
|
|
virtual void refit_nodes() = 0;
|
2019-01-08 17:10:32 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
virtual BVHNode *widen_children_nodes(const BVHNode *root) = 0;
|
2011-04-27 11:58:34 +00:00
|
|
|
};
|
|
|
|
|
2017-04-13 08:55:46 +00:00
|
|
|
/* Pack Utility */
|
2019-04-17 04:17:24 +00:00
|
|
|
struct BVHStackEntry {
|
|
|
|
const BVHNode *node;
|
|
|
|
int idx;
|
2011-04-27 11:58:34 +00:00
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
BVHStackEntry(const BVHNode *n = 0, int i = 0);
|
|
|
|
int encodeIdx() const;
|
2011-04-27 11:58:34 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
CCL_NAMESPACE_END
|
|
|
|
|
2019-04-17 04:17:24 +00:00
|
|
|
#endif /* __BVH_H__ */
|