TheSwamp
Code Red => AutoLISP (Vanilla / Visual) => Topic started by: myloveflyer on April 30, 2019, 05:11:40 AM

How to quickly connect to a triangular linear grid based on points？

That specific point cloud was generated either through interpolation of generatrix curve and then polar arrayed instead of making surface by revolving... So basically you are asking to recreate erased shape of only left guide points... Isn't that joking with peoples? I haven't worked much with point clouds, but if you can convert point group to cloud, I believe that CAD has implemented capability of generating polyface surface... When you get it (somehow), you could just explode it into lines you are searching for... Another option is to group generatrix segment  then automatically connect segments points with 3d lines (somehow  in correct manner) and finally do polar array of segment 3d lines... But all in all this is some sort of asking for help where help was deliberately neglected...

That specific point cloud was generated either through interpolation of generatrix curve and then polar arrayed instead of making surface by revolving... So basically you are asking to recreate erased shape of only left guide points... Isn't that joking with peoples? I haven't worked much with point clouds, but if you can convert point group to cloud, I believe that CAD has implemented capability of generating polyface surface... When you get it (somehow), you could just explode it into lines you are searching for... Another option is to group generatrix segment  then automatically connect segments points with 3d lines (somehow  in correct manner) and finally do polar array of segment 3d lines... But all in all this is some sort of asking for help where help was deliberately neglected...
I am very sorry, I may not have explained the problem clearly. I will provide EXCEL at these points later. I want to know if there is a faster way to connect these points.

Hello myloveflyer ,
You can try this (https://www.theswamp.org/index.php?topic=9042.0) .
It is not perfect , but you can do more than half of the job . For 100% , you need dedicated software , to ignore the triangles inside of the cone .
By the way , how you calculate / generate the points ?

Hello myloveflyer ,
You can try this (https://www.theswamp.org/index.php?topic=9042.0) .
It is not perfect , but you can do more than half of the job . For 100% , you need dedicated software , to ignore the triangles inside of the cone .
By the way , how you calculate / generate the points ?
These points are known at the beginning, I just want to know how to quickly connect these points.

Yes , use the provided link .
Download that lisp and enjoy it.