Rank: 459225 based on 0 downloads (last 30 days) and 0 file submitted
photo

Daniela

E-mail

Personal Profile:

 

Watch this Author's files

 

Comments and Ratings by Daniela View all
Updated File Comments Rating
28 Jul 2013 Inhull Efficient test for points inside a convex hull in n dimensions Author: John D'Errico

Hi

First of all thanks for your reply, it was very helpful. Till now the program was running smoothly but now I tried to find the normal of the plane containing the points(rows of X) X=[134 294 59; 136 295 59; 122 288 59]. The program is calculating the normal but it is giving out a 3x2 matrix rather than a 3x1 matrix causing the program to generate an error later on when projecting the points in Y to the 2D subplot (line of code: YPProj = YP(inplane,:)*B ).

Can you please guide me in what is causing this to happen?

Thanks for your great help once again.

23 Jul 2013 Inhull Efficient test for points inside a convex hull in n dimensions Author: John D'Errico

Thanks for your fast reply. I got the idea of determining whether the point lies on the plane of the triangle or not but I am a bit confused about converting the problem to 2D. Can you guide me to what is meant by this or else indicate me with some useful website? Thanks for your great help

22 Jul 2013 Inhull Efficient test for points inside a convex hull in n dimensions Author: John D'Errico

I am currently using the Inhull code for my project. I am passing to Inhull my set of testing points together with a 3*3 array. The 3*3 array contains the coordinates of the 3 vertices which are to form the convex hull. Upon running the code I am getting an error saying that I did not provide enough points.

This is the actual error I am getting:
Error using cgprechecks (line 41)
Not enough unique points specified.

Error in convhulln (line 42)
cgprechecks(x, nargin, cg_opt);

Error in inhull (line 81)
tess = convhulln(xyz,[]);

What can I do?

Contact us