PBRT
/home/felix/UBC/projects/AdaptiveLightfieldSampling/pbrt_v2/src/accelerators/bvh.h
00001 
00002 /*
00003     pbrt source code Copyright(c) 1998-2012 Matt Pharr and Greg Humphreys.
00004 
00005     This file is part of pbrt.
00006 
00007     Redistribution and use in source and binary forms, with or without
00008     modification, are permitted provided that the following conditions are
00009     met:
00010 
00011     - Redistributions of source code must retain the above copyright
00012       notice, this list of conditions and the following disclaimer.
00013 
00014     - Redistributions in binary form must reproduce the above copyright
00015       notice, this list of conditions and the following disclaimer in the
00016       documentation and/or other materials provided with the distribution.
00017 
00018     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
00019     IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
00020     TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
00021     PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
00022     HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
00023     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
00024     LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
00025     DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
00026     THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
00027     (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
00028     OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00029 
00030  */
00031 
00032 #if defined(_MSC_VER)
00033 #pragma once
00034 #endif
00035 
00036 #ifndef PBRT_ACCELERATORS_BVH_H
00037 #define PBRT_ACCELERATORS_BVH_H
00038 
00039 // accelerators/bvh.h*
00040 #include "pbrt.h"
00041 #include "primitive.h"
00042 struct BVHBuildNode;
00043 
00044 // BVHAccel Forward Declarations
00045 struct BVHPrimitiveInfo;
00046 struct LinearBVHNode;
00047 
00048 // BVHAccel Declarations
00049 class BVHAccel : public Aggregate {
00050 public:
00051     // BVHAccel Public Methods
00052     BVHAccel(const vector<Reference<Primitive> > &p, uint32_t maxPrims = 1,
00053              const string &sm = "sah");
00054     BBox WorldBound() const;
00055     bool CanIntersect() const { return true; }
00056     ~BVHAccel();
00057     bool Intersect(const Ray &ray, Intersection *isect) const;
00058     bool IntersectP(const Ray &ray) const;
00059 private:
00060     // BVHAccel Private Methods
00061     BVHBuildNode *recursiveBuild(MemoryArena &buildArena,
00062         vector<BVHPrimitiveInfo> &buildData, uint32_t start, uint32_t end,
00063         uint32_t *totalNodes, vector<Reference<Primitive> > &orderedPrims);
00064     uint32_t flattenBVHTree(BVHBuildNode *node, uint32_t *offset);
00065 
00066     // BVHAccel Private Data
00067     uint32_t maxPrimsInNode;
00068     enum SplitMethod { SPLIT_MIDDLE, SPLIT_EQUAL_COUNTS, SPLIT_SAH };
00069     SplitMethod splitMethod;
00070     vector<Reference<Primitive> > primitives;
00071     LinearBVHNode *nodes;
00072 };
00073 
00074 
00075 BVHAccel *CreateBVHAccelerator(const vector<Reference<Primitive> > &prims,
00076         const ParamSet &ps);
00077 
00078 #endif // PBRT_ACCELERATORS_BVH_H