Ray/triangle intersection using the algorithm proposed by MdoTAller and Trumbore (1997). The zip file includes one example of intersection.
References: [1] "Real Time Rendering". Third Edition. Tomas Akenine-MdoTAller, Eric Haines and Naty Hoffman. A. K. Peters, Ltd. 2008 (Section 16.8)
[2] "Fast, minimum storage ray-triangle intersection". Tomas MdoTAller and Ben Trumbore. ...
Calculation of intersection segment between a plane (defined with a point p0 that lies on the plane and a normal vector n of that plane) and a triangle (defined with its vertices P1, P2 and P3)
N : Normal to plane , |N| = 1,...
Pascal's triangle was a challenge on a forum I frequent today and this is what I came up with:
This toolbox can solve any of the 6 possible subproblems associated with an oblique spherical triangle, when only 3 of the 6 angles are known.
The toolbox basically is an implementation of the set of tools developed in [Wertz, 2001],...
Simulation of Triangle wave generator, using Simelectronics.
This function returns the basis of the intersection of N subspaces defined by their bases, and the dimension of this intersection. The input basis vectors must be row vectors!
Example: A = [1,1,-1,1; %<-basis vector ...
Purpose: Range/interval intersection
A and B two ranges of closed intervals written as vectors [lowerbound1 upperbound1 lowerbound2 upperbound2] or as matrix [lowerbound1, lowerbound2, lowerboundn; upperbound1,...
Find the intersection points of the edges of two 2D polygons, a simple function made to follow up a Newsgroup discussion
now simulate wave propagated with index triangle
Koch Snowflake and Sierpinski Triangle Combination Fractal using recursion.
this script prints a few lines of Pascal`s triangle ;-)
Two methods to return the intersection/union of sets of data, where the form of the data is not a limiting factor.
A simple little task, how to find the intersection of two hashes. There's probably many ways to do this but there is one way to avoid...
Intersection of two sets of positive integers (works much faster than built-in intersect)
[xs,ys] = cint(x1,y1,x2,y2) finds intersection points of the curves defined by straight lines between the length(x1) points in the plane, (x1,y1), and the length(x2) points in the plane (x2,y2).
The function essentially solves
This function shall be used to evaluate the union or intersection between fuzzy sets or fuzzy relation under type2 category.For a complete understanding Please refer book by Dr. Jerry M. Mendel on:
Uncertain Rule-Based Fuzzy Logic...
The Triangle method is due to Zack (Zack GW, Rogers WE, Latt SA (1977), "Automatic measurement of sister chromatid exchange frequency", J. Histochem. Cytochem. 25 (7): 741d-deOCt53.
A line is constructed between the maximum...
3-mscripts for generation of Fern, Triangle, Dragon standard fractals, and 2 additional mscripts for generation of hexagon and pentagram based fractals, all with introductory information contained in PDF document.
NUMREGPOLY Number of Intersection Points and Regions Made By The Diagonals of a Regular Polygon [A,B,I,R]=numregpoly(N) for integer n returns the following: A: Vector of number of points inside the regular n-gon other than...
%inside_triangle is used to check if a point P is inside %the triangle P1P2P3 or not. % %Inputs: P, P1, P2 and P3 are vectors of length 2 or three of the % form [x y z] or [x y] % %Output: True %True=1 => P is... |