Function for checking all objects between 2 points

[LSElite]

Hey All

I am attempting to make a function to check all objects between 2 points.
it needs to check their layers to see if it is an impassable object, eg: *Wall*,*Glaz*,*Struct*.

This is what I have so far but it is returning unpredictable data.

(defun ClashDetection ( pt1 pt2 )
	(if (setq s (ssget "_F" (list pt1 pt2)))
		(progn
			(setq 	i 0
					n (sslength s)
					check nil
			)
			(repeat n
				(setq 	e (ssname s i)
						x (cdr (assoc 8 (entget e)))
						WIP	(if (/= nil (wcmatch (strcase x) "*GENM*,*WALL*,*WALL,*GLAZ*,*GLAZ"))
									(setq check "T")
								)
						i (1+ i)
				)
			)
		)
	)
	print check
)




(defun c:ffs ()
	(setq 	ptstart		(getpoint)
			ptend		(getpoint)
			printout	(ClashDetection ptstart ptend)
	)
	princ printout
)

Any Help would be greatly appreciated.
Cheers

[LSElite]

Sorry all, I solved it after I posted and I cant seem to remove the thread.
just a simple variable reset.

here is the solution

(defun ClashDetection ( pt1 pt2 )
	(setq	n		nil
			s		nil
			e		nil
			x		nil
			check	nil
	)
	(if (setq s (ssget "_F" (list pt1 pt2)))
		(progn
			(setq 	i 0
					n (sslength s)
			)
			(repeat n
				(setq 	e (ssname s i)
						x (cdr (assoc 8 (entget e)))
						WIP	(if (/= nil (wcmatch (strcase x) "*GENM*,*WALL*,*WALL,*GLAZ*,*GLAZ"))
									(setq check "T")
								)
						i (1+ i)
				)
			)
		)
	)
	print n
)

(defun c:ffs ()
	(setq 	ptstart		(getpoint)
			ptend		(getpoint)
			printout	(ClashDetection ptstart ptend)
	)
	princ printout
)

[Wanderer]

Sorry all, I solved it after I posted and I cant seem to remove the thread.
just a simple variable reset.

here is the solution

Thanks for taking the time to post your solution. Maybe someone will see it in the future and benefit from it, too.

[peter]

FYI the ssget function has the ability to filter layers.

Another way to write the function would be to use the ssget filtering and sslength

(defun ClashDetection ( lstPoint1 lstPoint2 )
 (sslength (ssget "_f" (list lstPoint1 lstPoint2)
                       (list (cons 8 "*GENM*,*WALL*,*WALL,*GLAZ*,*GLAZ"))
           )
 )
)

[LSElite]

That is groovy, I love it when you can refine your code.
Cheers Peter.

[LSElite]

Peters solution works well but I am finding that it will not step into objects such as blocks, dynamic blocks or xrefs.
Ideally I would like it to look through all objects between 2 points and the objects within them.
Does anyone have any ideas?

[marko_ribar]

Peters solution works well but I am finding that it will not step into objects such as blocks, dynamic blocks or xrefs.
Ideally I would like it to look through all objects between 2 points and the objects within them.
Does anyone have any ideas?

LSElite, have you ever seen this post :
http://forums.augi.com/showthread.ph...ification&p=#8

HTH, M.R.

[LSElite]

Cheers mate, I forgot I had another thread floating around somewhere.
The code in your link is the one I am using and it for some reason still does not seem to reach into any objects.
It also seems to trip up when there are acceptable elements over the top of unacceptable elements.

The blue elements are hose runs and the grey elements are walls.
I've circled the issue.
ClashDetection.JPG

If all elements are bursted it works beautifully though, it just seems to be these final tweaks.
ClashDetection2.JPG

[peter]

It is possible to translate from the world coordinate system to a blocks coordinate system.

It should be straight forward to translate the two points into the selected blocks using recursion and find objects within the blocks.

P=

[LSElite]

Sounds like I am in over my head, can you recommend any good reference material I can use as a guide?