Got it!  Thanks.  :D  I'll test it today.

Having found the weights of neighbor vertices based on distance from a point, I've been wondering now whether we need the weighting based on tri edges.  Couldn't we just get the weights for the tri vertices as

weight = (point distance from tri vertex)/(sum of all distances from tri vertices)

for each point?  Mind you, I haven't tested this to be sure it gives me the same weighting values.  Would it be less precise?  If it worked and we didn't need point in tri to help weed out bad matches, I would wonder if we could even do away with a point in tri test and gather the nearest vertices.

Don't worry!  Fear not!  I'm not planning on changing anything in the code.  LOL  Nor am I questioning the validity or effectiveness of anything currently in the script.  I'm just wondering.  I suppose I'm thinking that possibly neighbor weights (or nearest verts weights) could have been used to get results from the original nearest vert process.

What do you think?  I'll just point out that this wasn't the reason I was looking for neighbor weights, yesterday.  I'm working toward stretch correction and detail preservation for a shrinkwrap run, and I thought neighbor weights might help me....

===========================sigline======================================================

Cage can be an opinionated jerk who posts without thinking.  He apologizes for this.  He's honestly not trying to be a turkeyhead.

Cage had some freebies, compatible with Poser 11 and below.  His Python scripts were saved at archive.org, along with the rest of the Morphography site, where they were hosted.