Jump to content

distance between points in lines ?


yajis_narif

Recommended Posts

hii

i have a drawing with 4 lines of points (each line of points with the same Y) . i have the coordinate of the points of each line in a list and all the lists in a list .

so now i want to calculate the disatnce between points of each list knowing that the number of points in lines may change and may not be equal as follows :

. . . . .

. . . . .

. . . .

. . .

 

 

so i've created a lisp that can measure the distance but the only problem is that i can calculate the distance only if the lines have the same number of points.

plzz help me ans again sorry my english is bad

Link to comment
Share on other sites

  • Replies 22
  • Created
  • Last Reply

Top Posters In This Topic

  • yajis_narif

    9

  • Lee Mac

    4

  • Ahankhah

    4

  • BlackBox

    3

Top Posters In This Topic

(defun LM:GroupByFoo ( lst foo )
 (if lst
   (cons
     (cons (car lst)
       (vl-remove-if-not '(lambda ( x ) (foo (cadr lst) x)) (cdr lst))
     )
     (LM:GroupByFoo (vl-remove-if '(lambda ( x ) (foo (car lst) x)) (cdr lst)) foo)
   )
 )
)

(defun c: test (all /)     
(setq lall(length all))
(setq f -1)
(setq sorty (list))
       (while ( < (setq f (1+ f)) lall)
(setq allc (vl-sort                                   
   (LM:GroupByFoo (nth f all)
    (lambda ( a b ) (equal (cadr a) (cadr b)))
   )
 '(lambda ( a b ) (< (cadar a) (cadar b)))
 )
)
(setq sorty (append sorty (list allc)))  
)
(setq ls (length sorty))
(setq lallc(length allc))

(setq n -1)
(setq sortall(list))
(while ( <(setq n (1+ n)) ls)
(setq m -1)
(setq sortx (list))
(while ( < (setq m (1+ m)) lallc)

(setq xx0 (vl-sort (nth m (nth n sorty))
(function (lambda (e1 e2)
( < (car e1) (car e2)) ) ) ))
(setq sortx (append sortx (list xx0)))            
)
(setq sortall(append sortall (list sortx)))          
)  
(setq Ldie(length sortall))
(setq di1 (nth 0 sortall))
(setq l1 (length (nth 0 sortall)))
(setq ty -1)
(setq lleny (list))
(while (< (setq ty (1+ ty)) l1)

(setq lleny (append lleny (list (length (nth ty di1)))))    
)
(princ lleny)

(setq diste (list))
(setq dislist (list))

(setq t -1)
(while ( <(setq t (1+ t)) l1)                                    
(setq r -1)
(setq q 0)
(setq diste (list))         
(while (and (< (setq r(1+ r)) 4)( < (setq q (+ 1 q)) 4))   

(setq di (distance (nth r (nth t (nth 0 sortall))) (nth q (nth t (nth 0 sortall)))))
(setq diste (append diste ( list di)))

)
(setq dislist(append dislist (list diste)))  
                      
)

 

thanks

Link to comment
Share on other sites

1- In your code one closing paranthesis is needed at the very end of file.

2- It is forbidden in AutoLISP to assign a name to a function or variable with spaces, so c: test is wrong.

3- A command defined by AutoLISP can not have any arguement, your command: test has: (defun c: test (all /) ...

 

I am checking the code.

Link to comment
Share on other sites

3- A command defined by AutoLISP can not have any arguement, your command: test has: (defun c: test (all /) ...

 

I believe what Ahankah is trying to say, is that in order to supply an argument to your function you might instead use:

 

(defun test (all / )
 ;; <-- Your code here

 

Example syntax: (test all)

Link to comment
Share on other sites

Renderman, you are right. English isn't my native language, I live in Iran, but you live Somewhere between Civil 3D and Maya, which means your language isn't Persian.

Link to comment
Share on other sites

Renderman, you are right. English isn't my native language, I live in Iran, but you live Somewhere between Civil 3D and Maya, which means your language isn't Persian.

 

Ahankhah, I mean no offense to you, my friend. :)

 

I simply tried to provide an example to your correct statement, as when I began programming LISP, I would not have understood fully. For me, sometimes 'seeing' an example helps me to understand.

 

I assure you, your English is far superior to my Persian. :thumbsup:

Link to comment
Share on other sites

Renderman, I just wanted to confess that I know my English isn't so good.

I respect you as one of the active members of CADTutor. I learn much in this forum and thank you and all other friends for this.

Link to comment
Share on other sites

i have a drawing with 4 lines of points (each line of points with the same Y) . i have the coordinate of the points of each line in a list and all the lists in a list .

so now i want to calculate the disatnce between points of each list knowing that the number of points in lines may change and may not be equal as follows :

. . . . .

. . . . .

. . . .

. . .

 

thanks tharwat

Link to comment
Share on other sites

If your point list is in the format:

 

(
 (<Point1> <Point2> ... <PointN>)
 (<Point1> <Point2> ... <PointN>)
 ...
 (<Point1> <Point2> ... <PointN>)
)

 

then perhaps:

 

(defun test ( mainlist )
 (mapcar
   (function
     (lambda ( sublist )
       (mapcar 'distance sublist (cdr sublist))
     )
   )
   mainlist
 )
)

Link to comment
Share on other sites

yes exactly my list is in that format and i want to calculate the distance between ( and ) ,( and )...... and )

Link to comment
Share on other sites

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