
/*
    pbrt source code Copyright(c) 1998-2012 Matt Pharr and Greg Humphreys.

    This file is part of pbrt.

    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions are
    met:

    - Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.

    - Redistributions in binary form must reproduce the above copyright
      notice, this list of conditions and the following disclaimer in the
      documentation and/or other materials provided with the distribution.

    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
    IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
    TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
    PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
    HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
    LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 */

#if defined(_MSC_VER)
#pragma once
#endif

#ifndef PBRT_ACCELERATORS_KDTREEACCEL_H
#define PBRT_ACCELERATORS_KDTREEACCEL_H

// accelerators/kdtreeaccel.h*]
#include "stdio.h"
#include <vector>
#include "PrimitiveTriangle.h"
#include "pbrt.h"
#include "memory.h"
#include "kdtree.h"

using namespace std;

// KdTreeAccel Declarations
struct KdAccelNode;
struct BoundEdge;
extern vector<BBox> Box_coordinates;

class KdTreeAccel
{
public:
    // KdTreeAccel Public Methods
    KdTreeAccel(const vector<Reference<PrimitiveTriangle> > &p, int icost = 80, int scost = 1,  float ebonus = 0.5f, int maxp = 1, int maxDepth = -1);
    
    BBox WorldBound() const { return bounds; }
    bool CanIntersect() const { return true; }
    ~KdTreeAccel();
    bool Intersect(const Ray &ray, Intersection *isect) const;
    bool IntersectP(const Ray &ray) const;
private:
    // KdTreeAccel Private Methods
    void buildTree(int nodeNum, const BBox &bounds,
        const vector<BBox> &primBounds, uint32_t *primNums, int nprims, int depth,
        BoundEdge *edges[3], uint32_t *prims0, uint32_t *prims1, int badRefines = 0);

    // KdTreeAccel Private Data
    int isectCost, traversalCost, maxPrims, maxDepth;
    float emptyBonus;
    vector<Reference<PrimitiveTriangle> > primitives;
    KdAccelNode *nodes;
    int nAllocedNodes, nextFreeNode;
    BBox bounds;
    MemoryArena arena;
};


struct KdToDo
{
    const KdAccelNode *node;
    float tmin, tmax;
};


KdTreeAccel *CreateKdTreeAccelerator(const vector<Reference<PrimitiveTriangle> > &prims);

#endif // PBRT_ACCELERATORS_KDTREEACCEL_H
