hw3/src/linear_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

/******************************************************************/
/* 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 "linear_intersector.h"

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


linear_intersector::linear_intersector(const std::vector<std::shared_ptr<const boundedPrimitive>>& compounds)
  : intersector_base()
{
  _compounds = compounds;
}


/////////////
// Methods //
/////////////
intersectionPoint linear_intersector::intersect(const ray& r) const
{
  // HW3: Implement this.
  //      Returns the nearest intersections point of the ray 'r' with the primitives in '_compounds'.
  // Returns: intersection point
  // Modifies: nothing
  intersectionPoint ip, current;

  for (auto itr = _compounds.begin(); itr != _compounds.end(); itr++) {

    if ((*itr)->hasShader()) {
      current = (*itr)->intersect(r);
      if (current < ip) { ip = current; }
    }

  }

  return ip;
}