limfx Posted August 12, 2023 Share Posted August 12, 2023 I am referencing a lisp but the problem is it works very slow, can anyone help me to make it work faster? boundary (BMS).LSP Quote Link to comment Share on other sites More sharing options...
limfx Posted August 12, 2023 Author Share Posted August 12, 2023 Thank you very much for all the help! Quote Link to comment Share on other sites More sharing options...
mhupp Posted August 12, 2023 Share Posted August 12, 2023 Quite a genius little bit of code. what its doing getting min and max points of selection set. Calculating the length and width then dividing the shortest side by 50 to get the increment starting the boundary command SPAM CLICKING a grid of points using the increment distance if the point is fully enclosed by entities it will create a boundary Stream lined the code to the best of my ability. But where the majority of the slow down is always going to be when the command function is called. So i made the increment offset for x and y independent. Resulting in a max of 2500 points picked vs the old code of 7007 points picked. (could be more depending on size) You could also lower the number of division but then you run the risk missing spaces. uncomment the (vla-addpoint if you want to see the points like above. Mulitiple Boundary Selection.LSP 2 Quote Link to comment Share on other sites More sharing options...
limfx Posted November 8, 2023 Author Share Posted November 8, 2023 On 8/12/2023 at 12:31 PM, mhupp said: Quite a genius little bit of code. what its doing getting min and max points of selection set. Calculating the length and width then dividing the shortest side by 50 to get the increment starting the boundary command SPAM CLICKING a grid of points using the increment distance if the point is fully enclosed by entities it will create a boundary Stream lined the code to the best of my ability. But where the majority of the slow down is always going to be when the command function is called. So i made the increment offset for x and y independent. Resulting in a max of 2500 points picked vs the old code of 7007 points picked. (could be more depending on size) You could also lower the number of division but then you run the risk missing spaces. uncomment the (vla-addpoint if you want to see the points like above. Mulitiple Boundary Selection.LSP 1.5 kB · 7 downloads It's been a while since I've been back to the forum. Thank you so much for helping me and for showing me how to do it faster! Dear Mhupp! 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.