Paul Higgins

Updated the attachment to fix a few problems

Lately I became interested in learning about neural networking the basis for A.I. I found lots of tutorials on the subject in many computer languages but none using OORexx. So I found the simplest one written in C++ and translated it to OORexx, works great, its attached, I think OORexx should include a sample like this. It might encourage younger users to use OORexx.

Well it took awhile but finally I have the merge code that has passed all my testers. It follows the intersection points of the polygons to merge them . I had to add a new method and some routines: - method distance - it finds the distance between two sets of lat/lons. Used to sort the intersections. - routine ring_array - orders the sections of the merging polygon so they can be processed sequentially. - routines Create_WP and Create_Route which create gpx files of the intersection points and the...

Well it took awhile but finally I have the merge code that has passed all my testers. It follows the intersection points of the polygons to merge them . I had to add a new method and some routines: * method distance - it finds the distance between two sets of lat/lons. Used to sort the intersections. * routine ring_array - orders the sections of the merging polygon so they can be processed sequentially. * routines Create_WP and Create_Route which create gpx files of the intersection points and the...

JanErik, When I put the code into my program all mt testing of it worked. But when I asked my tester too test he found it failed. I am working on a fix, Paul

I found the code would not support two cases: * When the two intersection points were on the same section (see attachment "IP on Same Section") * When there were more than two intersection points (see attachment "More than two Intersections") I've attached the new Polyshape.cls it works great.

I made the following change and it seems to work: if add_section > fin_section then add_section = 0 I put that right before your new code see the attached new polyshape.cls I will do more testing . I think the code will fail if there are more than two intersection points.

I am slowly digesting your code. I have never been a fan of the trace. I prefer to simply put in say statements. Now that I corrected the data it makes more sense. Will let you know what I find.