Hi all,
I'm working on a mbx to select all polygons from a table below a certain
size and combine them with the neighbour that has the longest common side. I
can easily select the polygons that are too small and by looping through
them one at a time I can select all the polygons that share a common
boundary with each one (the number of these could vary from 1 to 4)
The problem is this: How do I work out the length of the common
intersection, select the largest one, and then combine that polygon with the
one I'm currently working on in the loop?
I've looked at intersectnodes() but that creates a polyline between the
objects so I'd have to create and measure the 4 polylines at the
intersection of the polygons and then try and pick the 2 polygons to be
combined based on this figure. There must be a better way!
Thanks for the help (again!)
Jim Wilson
_______________________________________________________________________
List hosting provided by Directions Magazine | www.directionsmag.com |
To unsubscribe, send e-mail to [EMAIL PROTECTED] and
put "unsubscribe MapInfo-L" in the message body.
