LISP for Intersection Clean Up

[zorroxxxx]

Hi,

Does anyone have a LISP or Script that will clean up intersections? Both linear and radius intersections. I have been constantly trimming and after a few hundred thousand clicks, I figure there has to be an easier way. I've also have tried using BPOLY command but it creates polylines on top of existing lines, which I then have to delete. I am just learning LISP so I'm not sure how to conquer this problem.

I have attached a .BMP file which shows exactly what I'm looking for.

I run Vanilla ACAD 2002

Any help will be greatly appreciated

Gary

[mjfarrell]

Take a look here:http://www.cadresource.com/library/lispbc.html

[zorroxxxx]

Originally Posted by mjfarrell

Take a look here:http://www.cadresource.com/library/lispbc.html

Hi Michael,

Your link went to the B-C section of the site. Did you have a specific file in mind? I browsed the section and did not see anything that would work. Is there one there that can be modified to do what I need?

Thanks in advance,

Gary

[sinc]

I've wanted something similar in the past, so I figured I'd have a go at it. This is my first attempt at using the ActiveX interface, so some things might have been accomplished more easily in another way, but this works.

It lets you select a set of objects (any drawing objects should work, although results are unpredictable for circles). Any objects that intersect two and only two of the other objects in the selection set will be broken between the intersection points. If a given object has more than two intersections, then the code wouldn't know which segments to remove. It would need to be extended to allow the user to specify which segments to remove, possibly by selecting inside the desired intersections as you proposed, although I haven't yet figured out the best way of going about it. Feel free to tackle it yourself.

The code loops until you hit enter or right-click without selecting any objects.

;; takes a selection set, and trims the gap between intersection points for
;; all objects that intersect two and only two of the other objects in the set
;; Richard Sincovec, July 11 2004

(vl-load-com)
(defun c:itrim (/ acadObj doc ssets ss count err i j items item	intxlist
		intitem)
  (setq	acadObj	(vlax-get-acad-object)
	doc	(vla-get-activeDocument acadObj)
	ssets	(vla-get-selectionSets doc)
  )
  (setq	err (vl-catch-all-apply
	      (function
		(lambda	()
		  (setq ss (vla-add ssets "ZYZ_ITRIM"))
		) ;lambda
	      ) ;function
	    ) ;vl-catch-all-apply
  ) ;setq
  (if (vl-catch-all-error-p err)
    ;; error is probably "ss already exists"
    ;; it shouldn't yet, but use it if it does
    (setq ss (vla-item ssets "ZYZ_ITRIM"))
  ) ;if
  (while ; (MAIN)
    (progn
      (vla-clear ss)
      (vla-selectOnScreen ss)
      (setq count (vla-get-count ss))
      (/= count 0)
    ) ;progn
     (setq i count
	   items nil
     ) ;setq
     (while (/= i 0)
       (setq i	      (1- i)
	     item     (vla-item ss i)
	     j	      count
	     intxlist nil
       ) ;setq
       (while (/= j 0)
	 (setq j       (1- j)
	       intitem (vla-item ss j)
	 ) ;setq
	 ;; I kept getting an exception on vlax-safearray->list
	 ;; if intersectWith found no points, and couldn't figure
	 ;; out offhand how to stop getting it, so I decided to catch
	 ;; and ignore it instead
	 (if (/= (vla-get-handle item) (vla-get-handle intitem))
	   (vl-catch-all-apply
	     (function
	       (lambda ()
		 (setq
		   intx	    (vlax-safearray->list
			      (vlax-variant-value
				(vla-IntersectWith
				  item
				  intitem
				  acExtendNone
				)
			      )
			    )
		   intxlist (append intxlist (list intx))
		 ) ;setq
	       ) ;lambda
	     ) ;function
	   ) ;vl-catch-all-apply
	 ) ;if
       ) ;while j
       ;; if we found two and only two intersections, store the entity for breaking
       ;; if we break it now, it will confuse the rest of the intersection checking
       (if (= (length intxlist) 2)
	 (setq
	   items (append
		   items
		   (list (cons (vlax-vla-object->ename item) intxlist))
		 )
	 )
       ) ;if
     ) ;while i
     ;; break the items
     (foreach item items
       (command	"break"
		(list (car item) (cadr item))
		(caddr item)
       )
     ) ;foreach
  ) ;while (MAIN)
  (vla-delete ss)
  (princ)
) ;defun

[peter]

here is a little routine that I cooked up. Just select the 4 lines to trim and it should clip them the way you want.

Peter Jamtgaard

(defun C:TRIMIT3 (/ intCount 
                   lstPairs3                  
                   lstPoints3
                   lstPoints4
                   lstObjects
                   lstObjects2
                   lstObjects3
                   ssSelections  )

 (setq ssSelections (ssget (list (cons 0 "*line,arc"))))
 (repeat (setq intCount (sslength ssSelections))
  (setq intCount   (1- intCount)
        lstObjects (cons (vlax-ename->vla-object (ssname ssSelections intCount))
                         lstObjects
                   )
  )
 )
 (repeat (setq intCount (length lstObjects))
  (setq intCount     (1- intCount)
        objSelection (nth intCount lstObjects)
        lstPairs3    nil
  )
  (repeat (setq intCount2 (length (setq lstObjects2 (vl-remove objSelection lstObjects))))
   (if (not 
        (vl-catch-all-error-p
         (vl-catch-all-apply
         '(lambda (X Y)
           (setq varPOint (vla-intersectwith X Y 0))
          )
          (list objSelection (nth (1- intCount2) lstObjects2))
         )
        )
       )
    (progn
     (if (safearray-value (variant-value varPoint))
      (progn 
       (setq lstPoint  (vlax-safearray->list (variant-value varPoint))
             lstPairs3 (cons (cons (vlax-curve-getparamatpoint objSelection lstPoint)
                                     lstPoint                                   
                               )
                               lstPairs3
                         )
       )
      )
     )
    )
   )
   
   (setq intCount2 (1- intCount2))   
  )
  (if lstPairs3
   (progn
    (setq lstPairs3  (sortList lstPairs3 0)
          lstPoints3 (mapcar 'cdr lstPairs3)

    )
   )
  )
  (setq lstPoints4 (cons (cons objSelection (reverse lstPoints3))
                         lstPoints4
                   )
        lstPoints3 nil
        lstPairs   nil
  )  
 )
 (foreach lstN lstPoints4
  (setq objSelection (car lstN)
        lstN         (cdr lstN)
  )
  (repeat (/ (length lstN) 2)
   (vl-cmdf "break"           
            (vlax-vla-object->ename objSelection)            
            "F"
            (car lstN)
            (cadr lstN)
   )
   (setq lstN (cddr lstN))
  )
 )
)
(defun SortList (lstOfLists intItem)
 (vl-sort lstOfLists '(lambda (n1 n2) (<= (nth intItem n1) (nth intItem n2))))
)

[zorroxxxx]

Thanks to all for solving my problem.

Richards' file worked great for individual intersections and Peter's file worked for individual and multiple intersections. Thanks to Michael for a link to a good LISP resource.

As a beginner in the world of LISP maybe someday I'll be able to help someone as you have.

THANKS!!!

Gary

[zorroxxxx]

Peter,

Your file only seems to work in Acad 2004. I emailed it to my work and could not get it to run on Acad 2002.

Is there a way to modify your file to get it working in 2002?

Thanks in advance,

Gary

[jwanstaett]

add

(vl-load-com)
to the start of peter file as richards did and it will work in in 2002

[Lemons]

I just use a fillet crossing with a zero radius to do this:

(defun c:fc () (command "undo" "m") (command "fillet" "R" "0") (command "fillet" "c"))

[sinc]

If you try the routines we posted, you'll see they do something different. They actually do the equivalent of breaking four lines and then running your fc function four times... (in the simplest case, anyway...)