pietrow Posted September 21, 2022 Posted September 21, 2022 (edited) Hi i have some idea for lisp that creates path between MTEXTs or TEXTs and the path should be based on existing grid (many intersecting plines). I attached dwg files with description in the steps and some assumptions, I think it is clear how it should work, but i have no idea how to search for specific points on the grid. Below is the example. I want to create 3 paths; A-A1, A-A2 and A-A3. Or maybe is there a lisp that do the same? Any help will be appreciated. EDIT: I had another idea. Let's say that A1 is now A2, so we have to A2 points. Programm should compare this to points and create path from A to closest A2 to A, and end at the farest A2, like below: Creating_path.dwg Edited September 21, 2022 by pietrow Quote
ronjonp Posted September 21, 2022 Posted September 21, 2022 This is the algorithm. If you use CAB's breakall routine on your linework and use blocks for the start and end point you should have what you want. 1 Quote
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.