MrGroove Posted August 5, 2018 Share Posted August 5, 2018 Hi everbody, i've got an array of n-vectors, which define an outline of an intersection. My problem - they are not "ordered", so it can happen, that there are "cross lines". is it possible to "order" them by the nearest distance to each other? Best Quote Link to comment Share on other sites More sharing options...
MrGroove Posted August 5, 2018 Author Share Posted August 5, 2018 Quote Link to comment Share on other sites More sharing options...
TheBoneJarmer Posted August 5, 2018 Share Posted August 5, 2018 Your question sounds quite confusing. If I understand it correctly, you got vertices who are at the exact same spot and therefore causes cross lines and you want to figure out how to prevent that by ordering them..? What is it that you are trying to archive? And for the sake of complete understanding, can you zip up what you got now and add it as an attachment? That really would make things a looooot easier since we are dealing with logic and 3D algorithms here. ? Quote Link to comment Share on other sites More sharing options...
JohnK Posted August 6, 2018 Share Posted August 6, 2018 CSG (Constructive Solid Geometry) https://github.com/CraigFeldspar/BabylonCSG deals with adding, and subtracting two meshes and must deal with their intersection. So there must be something in the code for this that will help you. 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.