here is the example of index used in an EFGM code
[index] = define_support(node,pt1,di);
function [index] = define_support(node,x,di)
% find nodes in neighbouring of point x
% Inputs:
% node : numnode x 2, nodal coordinates
% x : 1 x 2, coordinate of point
% di : 1 x numnode, size of support of nodes
numnode = size(node,1);
dif = node - [ones(numnode,1)*x(1,1) ones(numnode,1)*x(1,2)]; % difference between co-ordinates of nodes and point pt in the main code
for i = 1 : numnode
r(i) = norm(dif(i,:));
end
index = find(r - di
I hope the following can answer your questions:
di = the radius of supporting domain of the point of interest (node)
r = a vector contains of distances between the point of interest and neighborhood points
index = a vector contains of value "ones" indicating the points within the supporting domain of the point of interest
Please correct me if I am wrong. ;-)
RESPECTED
Buntara Sthenly Gan
YOUR ANSWER IS ABSOLUTELY CORRECT BUT I AM CONFUSED THAT WITH A HIGHER NODAL DENSITY MY INDEX IS COMING OUT TO BE SMALLER NEVERTHELESS THANKS FOR YOUR ANSWER
REGARDS
SAHIL GARG
Dear Sahil
Yes, I think because the function "find" will "skipped" if the criteria is not fulfilled.
Thats why the array is reduced only to a number of points inside the supported domain.
Good luck.
'index' is an array of node indices that lie within a circle centered at 'x' with radius of 'di'. This is used to find the nodes surrounding a Gauss point.
Best regards,
Phu
- Badges
- Science topic