Hey i kinda need help vectorizing the line below. Mod_normal is a scalar while P1, P2, P3, Prime are points in [xyz] format.

1 次查看(过去 30 天)
V1 = P2 - prime; V2 = P3 - prime;
alpha = norm(cross_product((V1), (V2)))/ ( Mod_normal);
V1 = P3 - prime; V2 = P1 - prime;
beta = norm(cross_product((V1), (V2)))/ ( Mod_normal);
V1 = P1 - prime; V2 = P2 - prime;
alpha2 = norm(cross_product((V1), (V2)))/ ( Mod_normal);
gamma = 1 - alpha - beta;
gamma2 = 1 - alpha2 - alpha;
gamma3 = 1 - beta - alpha2;
checklist = [alpha, beta,alpha2, gamma2,gamma3, gamma];
  4 个评论
Muhamad Amirulfaris Abdullah
I think it would be easier if I give the code. I attached the code below. I was trying to speed up the code. BAsically the inputs of the function are Three vector points of xyz which is P1 P2 and P3. with P0 as testing pint. The function calculates the distance between point P0 and triangle P123. I was trying to code an alternate method besides David Eberly's pointtriangle distance code. I was wondering if there is any way which i can speed up the code

请先登录,再进行评论。

回答(1 个)

Maadhav Akula
Maadhav Akula 2019-8-6
I think the code which you have provided runs pretty fast and only changes in your code would be to use the in-built functions such as cross, dot, norm to compute the cross-product, dot-product and magnitude of vectors respectively.
Hope this helps!

类别

Help CenterFile Exchange 中查找有关 Linear Algebra 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by