hw6/src/bvh_intersector.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

/******************************************************************/
/* This file is part of the homework assignments for CSCI-427/527 */
/* at The College of William & Mary and authored by Pieter Peers. */
/* No part of this file, whether altered or in original form, can */
/* be distributed or used outside the context of CSCI-427/527     */
/* without consent of either the College of William & Mary or     */
/* Pieter Peers.                                                  */
/******************************************************************/
#include "bvh_intersector.h"
#include "boundedVolumeNode.h"

//////////////////
// Constructors //
//////////////////
bvh_intersector::bvh_intersector(void)
  : intersector_base()
{
  // Do nothing
}


bvh_intersector::bvh_intersector(const std::vector<std::shared_ptr<const boundedPrimitive>>& compounds)
  : intersector_base()
{
  // quick bail out if no compounds provided
  if(compounds.empty()) return; 

  // make a copy
  std::vector<std::shared_ptr<const boundedPrimitive>> compoundCopy = compounds;

  // create node
  //   trivial case: only a single node
  if(compounds.size() == 1)
    _root = compounds[0];
  //   compound case: create a bvh
  else
    _root = std::shared_ptr<const boundedPrimitive>(new boundedVolumeNode(compoundCopy.begin(), compoundCopy.end()));
}

  
/////////////
// Methods //
/////////////
intersectionPoint bvh_intersector::intersect(const ray& r) const
{
  // check if BVH exists => empty intersection point if not.
  if(!_root) return intersectionPoint();

  // intersect
  return _root->intersect(r);
}