title: Efficient AABB/triangle intersection in C#
body: <p>Can anyone recommend an efficient port to CSharp of any of the public AABB/triangle intersection algorithms.</p>
  
  <p>I've been looking at Moller's approach, described abstractly <a href="http://fileadmin.cs.lth.se/cs/Personal/Tomas_Akenine-Moller/pubs/tribox.pdf" rel="noreferrer">here</a>, and if I were to port it, I would probably start from <a href="http://fileadmin.cs.lth.se/cs/Personal/Tomas_Akenine-Moller/code/tribox3.txt" rel="noreferrer">this C++ version</a>.  <a href="http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=10317&amp;lngWId=3" rel="noreferrer">This C++ library by Mike Vandelay</a> seems like it could also be a great starting point.</p>
  
  <p>...or... any other "wheel" that can take a triangle of Vector3's and tell me if it intersects with an AABB), relatively efficiently.  </p>
  
  <p>There seem to be a variety of algorithms, but most seem to be written in c++, or just described abstractly in white papers and I need a c# specific implementation for our application.  Efficiency is not key, but c# is.  (though efficiency is obviously nice too of course ;p )</p>
  
  <p>Any C# options, before I wade through a "math" port ;) would be greatly appreciated!  Thanks.</p>