As far as I know only components know where they are in world space. I
doubt there is anything like a table you can just look up quickly. You
might come up with some algorithms that will reduce number of verts needed
for test by maybe eliminating some objects first based on the distance. I
think if
No, the reason being is I don't want to have a reference to anything. I
want to just be able to select the verts and check if anything is close.
I am currently trying with a 'Point Hash' but if you guys can think of
anything else I am all ears.
On Thursday, September 22, 2016 at 2:31:12 PM UT
Can you use objects names ?
On Sep 22, 2016 4:00 PM, "I73" wrote:
> Here is my problem, I have a list of verts and they are very close to
> another objects verts, I would like to be able to use (object A) list of
> verts to grab (object B) list of verts I don't want to iterate through
> (object B
