- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report
Here ya go, you challenge hungry carnivores.
Attached is a drawing of a simple closed polyline (red) being intersected at two points by an open polyline (white). Actually there are 4 different versions of the same thing, the differences being the polyline directions.
Your challenge is to write a function (or more) to split the closed polylines into two (2) pieces at the intersection points so that each end of the two resulting polylines have coincident end points. No, not necessarily startpoint coincident with startpoint and endpoint coincident with endpoint, but probably more like (equal start1 end2 fuzz) and (equal end1 start2 fuzz), so that they could be easily joined.
Your function must require only the selection of the open polyline, nothing more.
Unless you've programmed this before, you will be quite surprised with your first attempts.
I suggest that you copy the originals over to the right any number of times for testing.
Please include your initials in the name of the function that you post.
John F. Uhden
Solved! Go to Solution.