Lets say I have two lines that are perpendicular, slthough one could be skewed, that are supposed to intersect each other. The point of intersection is what I want to find as this has meaning to my application.
If the lines don't intersect, as in the lines don't touch but are really close to touching, what is the best way to find all the elements near a line end point and then iterate over those to weed out the lines?
Can I build a selection set that would encompass all elements in a certain area around a line endpoint? If so, how do I do that?
I'm not really sure what it is that you are trying to do.
Can you be more specific, maybe tell us what you intend for your program to do (the overall function of it)
Using the getclosestpointto method, you can find the perpendicular intersection of any point to a line, then using a little trig, you can determine the distance of the intersection and the endpoint of the line in question. which you can use to find out if they are touching or not.