Jump to content

Recommended Posts

Posted (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.

 

image.thumb.png.910b62e839f00e597f4aef3b4ae9d0f4.png

 

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:

image.thumb.png.3c36d234ec9104f7573ac5a1da80ccc7.png

 

Creating_path.dwg

Edited by pietrow
  • pietrow changed the title to Creating path between two MTEXTs
Posted

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.

  • Thanks 1

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.

Guest
Unfortunately, your content contains terms that we do not allow. Please edit your content to remove the highlighted words below.
Reply to this topic...

×   Pasted as rich text.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...