PBRT
|
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_GRID_H 00037 #define PBRT_ACCELERATORS_GRID_H 00038 00039 // accelerators/grid.h* 00040 #include "pbrt.h" 00041 #include "primitive.h" 00042 00043 // GridAccel Forward Declarations 00044 struct Voxel; 00045 00046 // Voxel Declarations 00047 struct Voxel { 00048 // Voxel Public Methods 00049 uint32_t size() const { return primitives.size(); } 00050 Voxel() { } 00051 Voxel(Reference<Primitive> op) { 00052 allCanIntersect = false; 00053 primitives.push_back(op); 00054 } 00055 void AddPrimitive(Reference<Primitive> prim) { 00056 primitives.push_back(prim); 00057 } 00058 bool Intersect(const Ray &ray, Intersection *isect, RWMutexLock &lock); 00059 bool IntersectP(const Ray &ray, RWMutexLock &lock); 00060 private: 00061 vector<Reference<Primitive> > primitives; 00062 bool allCanIntersect; 00063 }; 00064 00065 00066 00067 // GridAccel Declarations 00068 class GridAccel : public Aggregate { 00069 public: 00070 // GridAccel Public Methods 00071 GridAccel(const vector<Reference<Primitive> > &p, bool refineImmediately); 00072 BBox WorldBound() const; 00073 bool CanIntersect() const { return true; } 00074 ~GridAccel(); 00075 bool Intersect(const Ray &ray, Intersection *isect) const; 00076 bool IntersectP(const Ray &ray) const; 00077 private: 00078 // GridAccel Private Methods 00079 int posToVoxel(const Point &P, int axis) const { 00080 int v = Float2Int((P[axis] - bounds.pMin[axis]) * 00081 invWidth[axis]); 00082 return Clamp(v, 0, nVoxels[axis]-1); 00083 } 00084 float voxelToPos(int p, int axis) const { 00085 return bounds.pMin[axis] + p * width[axis]; 00086 } 00087 inline int offset(int x, int y, int z) const { 00088 return z*nVoxels[0]*nVoxels[1] + y*nVoxels[0] + x; 00089 } 00090 00091 // GridAccel Private Data 00092 vector<Reference<Primitive> > primitives; 00093 int nVoxels[3]; 00094 BBox bounds; 00095 Vector width, invWidth; 00096 Voxel **voxels; 00097 MemoryArena voxelArena; 00098 mutable RWMutex *rwMutex; 00099 }; 00100 00101 00102 GridAccel *CreateGridAccelerator(const vector<Reference<Primitive> > &prims, 00103 const ParamSet &ps); 00104 00105 #endif // PBRT_ACCELERATORS_GRID_H