NASAJPL
Mechanical
- Nov 9, 2023
- 5
Y'all...
Imagine this:
Collection A B
of Nodes Nodes
10001 20001
10002 20002
10003 20003
⋮ ⋮
10123 29876
I desire to get the closest node from 10001 to {20001~29876}
closest from 10002 to {20001~29876}
closest from 10003 to {20001~29876}
etc.
A N D / O R
print out of 'distance' from 10001 to each of {20001~29876}
print out of 'distance' from 10002 to each of {20001~29876}
etc.
Also, Someone on this great forum indicated there exists a function that queries for the proximity of a pair (to many number of) nodes called, feCheckCoincidentNode1 or 2 or 3 or sumsing like zat.
I'm on Femap Build Number: 2301.42
and I can't call this function. Has it disappeared or changed its call name?
Wherez the documentation on the input arguments and stuff related to this family of nodal query function? Is there other functions similar to this type?
As always, Pre-thanks. Nice day.
Imagine this:
Collection A B
of Nodes Nodes
10001 20001
10002 20002
10003 20003
⋮ ⋮
10123 29876
I desire to get the closest node from 10001 to {20001~29876}
closest from 10002 to {20001~29876}
closest from 10003 to {20001~29876}
etc.
A N D / O R
print out of 'distance' from 10001 to each of {20001~29876}
print out of 'distance' from 10002 to each of {20001~29876}
etc.
Also, Someone on this great forum indicated there exists a function that queries for the proximity of a pair (to many number of) nodes called, feCheckCoincidentNode1 or 2 or 3 or sumsing like zat.
I'm on Femap Build Number: 2301.42
and I can't call this function. Has it disappeared or changed its call name?
Wherez the documentation on the input arguments and stuff related to this family of nodal query function? Is there other functions similar to this type?
As always, Pre-thanks. Nice day.