BludArtworks Posted January 5, 2018 Share Posted January 5, 2018 Hello ! I'm struggling to analyse points from a mesh and only keep x number (like 4?) of the farthest points from each others. I tried to grab the distances in vex then using delete node but its not working properly, didnt find a way to parse every point and compare between them. Tried average but then again I dont know how to compare each points from each other. Thanks Quote Link to comment Share on other sites More sharing options...
Jesper Rahlff Posted January 6, 2018 Share Posted January 6, 2018 (edited) not sure I understand what it is you want to do? you want to find the 4 farthest points to each point? Edited January 6, 2018 by Jesper Rahlff Quote Link to comment Share on other sites More sharing options...
Noobini Posted January 6, 2018 Share Posted January 6, 2018 i struggled to understand this at first too...but now I remember doing ConnVerts (MCG in Max) which is like Plexus effect where each point connects to every other point. So having that picture in my mind, I think effectively: make a line between all poss combos of 2 points, sort by line length, reverse, from then on it's just whatever flavour you prefer to make your group selection/deletion... Quote Link to comment Share on other sites More sharing options...
Noobini Posted January 6, 2018 Share Posted January 6, 2018 (edited) dunno...something like this ? (hehe note the hillbilly approach again....no vex...coz I'm not good at it, ah well you just think a bit differently...) deletebydist.hipnc Edited January 6, 2018 by Noobini Quote Link to comment Share on other sites More sharing options...
Jesper Rahlff Posted January 6, 2018 Share Posted January 6, 2018 (edited) yeah that could work. My approach would be to use nearpoints() to find all points. Because nearpoints write to an array with the closest point first you could just remove everything except the last 4 entries and then you would have the 4 points furthest away. do this for all points, and you would have an array attached to each point. I guess from there you could just select which point(s) you wanted and the array would hold the ptnum of the points. Sorry for the vex talk again. My brain just works easiest that way, especially because I really strive to get better at it. btw I know you all hate me for not uploading hip files but I can't unfortunately upload anything while I am at work. (restrictions and stuff). Edited January 6, 2018 by Jesper Rahlff Quote Link to comment Share on other sites More sharing options...
Noobini Posted January 6, 2018 Share Posted January 6, 2018 whatever approach, i'm still not 100% on the qualifications tho...so for a point X, if it's too close to point Y...let's assume it qualifies for deletion...but if point X is sooooo far away from point Z...should it be deleted or kept...which one wins out ? ie. shortest/longest distance, which one has priority ? OP ? Quote Link to comment Share on other sites More sharing options...
Jesper Rahlff Posted January 6, 2018 Share Posted January 6, 2018 I am now following you? what do you mean priority? 28 minutes ago, Noobini said: whatever approach, i'm still not 100% on the qualifications tho...so for a point X, if it's too close to point Y...let's assume it qualifies for deletion...but if point X is sooooo far away from point Z...should it be deleted or kept...which one wins out ? ie. shortest/longest distance, which one has priority ? OP ? Quote Link to comment Share on other sites More sharing options...
Noobini Posted January 6, 2018 Share Posted January 6, 2018 coz the OP says he wants to keep those points furthest from each other...so that sorta tells me that's his primary criteria...so if point X qualifies for deletion with the shortest distance to some neighbour but also qualifies to be kept coz it's so far away from some other neighbour....someone has to make an executive decision...:) Quote Link to comment Share on other sites More sharing options...
Jesper Rahlff Posted January 6, 2018 Share Posted January 6, 2018 ah okay yeah I understand now. That was actually my original question. Because it seemed strange to want to have the 4 furthest points on a per point level.. exactly for the same reason as you just describred.. @Noobini Quote Link to comment Share on other sites More sharing options...
BludArtworks Posted January 8, 2018 Author Share Posted January 8, 2018 (edited) Hello there ! Its indeed a bit weird now I think about it, the idea is to distribute a precise number sphere on meshes point , picking the farthest point so the spheres dont overlap. then using theses to create selection groups ect ect.. Thanks for your replies and sorry for the confusion. Edited January 8, 2018 by BludArtworks image too big Quote Link to comment Share on other sites More sharing options...
Jesper Rahlff Posted January 8, 2018 Share Posted January 8, 2018 1 hour ago, BludArtworks said: Hello there ! Its indeed a bit weird now I think about it, the idea is to distribute a precise number sphere on meshes point , picking the farthest point so the spheres dont overlap. then using theses to create selection groups ect ect.. Thanks for your replies and sorry for the confusion. I am still confused where it all starts.. to find a distance you need a start and end points. end point in this case being the farthest point away from... ? each point on the mesh? Quote Link to comment Share on other sites More sharing options...
BludArtworks Posted January 9, 2018 Author Share Posted January 9, 2018 15 hours ago, Jesper Rahlff said: I am still confused where it all starts.. to find a distance you need a start and end points. end point in this case being the farthest point away from... ? each point on the mesh? Precisely, but its just the way I found to distribute spheres on mesh based on points and making them not overlap. Using copy stamp. Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.