Ray/triangle intersection using the algorithm proposed by Möller and
Trumbore (1997), implemented as highly vectorized MATLAB code.
The algorithm can work with one and two sided surfaces, as well as, with
infinite lines, rays (lines bounded on one side) and segments (lines bounded on
Input (all arrays in in Nx3, where N is number of vertices or rays):
orig : ray's origin
dir : ray's direction
vert0, vert1, vert2: vertices of the triangle
Intersect - boolean array of length N
t - distance from the ray origin to the intersection point in |dir|
u,v - barycentric coordinates of the intersection point units
xcoor - carthesian coordinates of the intersection point
In addition PointInsideVolume is 3D equivalent to 2D inpolygon function and can test if
array of points is inside or outside any volume defined by the surface grid.
many faces / many rays intersection, the return value 'flag'? Should it be a matrix but actual it is not.
Hello, Can anyone help me! Now I have a series of path points, and I want project them on a specified mesh surface along the specified direction, for example dir=(0,0,1). For every path point, I can iterate over all the triangular meshes to get the corresponding projection points，but this is too time-consuming. Can I use a faster method？
I want to get the projection point of all the points in the fixed direction on the triangular mesh surface. How can I use the 'many faces / many rays intersection' ?
Does the many rays-many faces case only work with Nfaces==Nrays? If so, is there any specific reason for implementing that specific case?
Actually for multiple faces and multiple rays, one should remember you need to repmat origin, if all origins are same.
To do your program better I suggests
1) Add description about use option FullReturn. It shold be '1' but not 'true' for example.
2) Add in initialize default output string
If xcoor not initialized than if no intersections error appear with params count.
Nice vectorised implementation with handy options for choosing between ray/line/segments and handling numerical precision issues - thanks!
Reply to Murat: You might have to look into using "border" parameter. If it does not work can you construct a scenario that demonstrates the issue and email it to me
Hi, the code is working well but it sometimes cannot handle with large incident angles. When the incident angle is around 90, it ignores triangles. Could you correct it?
I'm having trouble with the many rays, many faces option. Lets say I have 11 faces and 5 rays. What resizing of the inputs needs to be done? Do I need to repmat all arrays to be of size 55x3?
Based on what I can tell it can handle:
- one ray, many faces
- many rays, one face
- many rays, many faces (but # of faces = # of rays)
But I think I am just missing something here.
Reply to Nick: In many rays and many triangle case you still test for intersection of prearranged pairs and the return value informs you which ray/triangle pair intersected
Very useful but when considering many rays and many triangles is there a way to find which ray has intersected which triangle?
Excellent.. Really helpful!!!
Looks great. Downloaded and will try it later.
Re to Anton Semechko: This is a low level function which can be called with one ray and many faces, many faces and one ray or many faces and rays. It is quite simple to apply repmat function to the inputs.
why does the number of rays have to equal the number of faces? that's so inconvenient
small corrections to the interface
Minimal changes suggested by Igor in Comments and Ratings
correct description: no symbolic toolbox is needed
Major rewrite of the function with additional options and output variables. Also provided PointInsideVolume function
documentation improvements and typo correction
correct treatment of 3x3 arrays as suggested by Andreas Weber
Improvements to border handling
Inspired by: Ray/Triangle Intersection
View the winning live scripts from faculty and students who participated in the recent challenge.Learn more
Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.