PBRT
/home/felix/UBC/projects/AdaptiveLightfieldSampling/pbrt_v2/src/accelerators/kdtreeaccel.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_KDTREEACCEL_H
00037 #define PBRT_ACCELERATORS_KDTREEACCEL_H
00038 
00039 // accelerators/kdtreeaccel.h*
00040 #include "pbrt.h"
00041 #include "primitive.h"
00042 
00043 // KdTreeAccel Declarations
00044 struct KdAccelNode;
00045 struct BoundEdge;
00046 class KdTreeAccel : public Aggregate {
00047 public:
00048     // KdTreeAccel Public Methods
00049     KdTreeAccel(const vector<Reference<Primitive> > &p,
00050                 int icost = 80, int scost = 1,  float ebonus = 0.5f, int maxp = 1,
00051                 int maxDepth = -1);
00052     BBox WorldBound() const { return bounds; }
00053     bool CanIntersect() const { return true; }
00054     ~KdTreeAccel();
00055     bool Intersect(const Ray &ray, Intersection *isect) const;
00056     bool IntersectP(const Ray &ray) const;
00057 private:
00058     // KdTreeAccel Private Methods
00059     void buildTree(int nodeNum, const BBox &bounds,
00060         const vector<BBox> &primBounds, uint32_t *primNums, int nprims, int depth,
00061         BoundEdge *edges[3], uint32_t *prims0, uint32_t *prims1, int badRefines = 0);
00062 
00063     // KdTreeAccel Private Data
00064     int isectCost, traversalCost, maxPrims, maxDepth;
00065     float emptyBonus;
00066     vector<Reference<Primitive> > primitives;
00067     KdAccelNode *nodes;
00068     int nAllocedNodes, nextFreeNode;
00069     BBox bounds;
00070     MemoryArena arena;
00071 };
00072 
00073 
00074 struct KdToDo {
00075     const KdAccelNode *node;
00076     float tmin, tmax;
00077 };
00078 
00079 
00080 KdTreeAccel *CreateKdTreeAccelerator(const vector<Reference<Primitive> > &prims,
00081         const ParamSet &ps);
00082 
00083 #endif // PBRT_ACCELERATORS_KDTREEACCEL_H