title: Detect if vertex is inside a list of points (cube)
body: <p>I want to find if a vertex is inside of a cube in a C++ program.</p>
  
  <p>Take this example, I want to find all vertices of the torus that lie inside of the cube.</p>
  
  <p><a href="http://puu.sh/dnvZt/751c4e089a.jpg" rel="nofollow noreferrer">Image</a>
  <img src="https://i.stack.imgur.com/72GtR.jpg" alt="enter image description here"></p>
  
  <p>How would I go on doing this, knowing that my cube is just a list of points to start with (I'm parsing an .obj file)</p>
  
  <p>For example, my cube vertices:</p>
  
  <pre><code>v  -56.269790649414 -100.226547241211 -29.616094589233
  v  3.730209350586 -100.226547241211 -29.616094589233
  v  -56.269790649414 -40.226547241211 -29.616094589233
  v  3.730209350586 -40.226547241211 -29.616094589233
  v  -56.269790649414 -100.226547241211 30.383905410767
  v  3.730209350586 -100.226547241211 30.383905410767
  v  -56.269790649414 -40.226547241211 30.383905410767
  v  3.730209350586 -40.226547241211 30.383905410767
  </code></pre>
  
  <p>What are the best practices/algorithms to achieve this (raycasting?)</p>