How do I combine polygons?
The advantage of vacapincta’s method is that it’s a clever heuristic that doesn’t break on the same things (or require the same set of hoopjumps) as the vertex method. It’s rather elegant, but it has its own strengths and weaknesses and so may not work that great for your specific application. I think I’d have to add the vertices in their “natural order” traversing the cluster’s polygon clockwise (or counterclockwise). Yeah. One possible method: – Combine your edge data into the Big List; – Start traversing clockwise along the edges of some known-outer-edge polygon; – Each edge you traverse to, check for duplication. If you don’t find it, add it to the New List. If you do find a dupe, delete the pair and traverse next to the next clockwise edge of the polygon that owns the other half of the duplicate. When you’re done, New List should have a happy in-order outline. Again, this may fail or need extra passes at least for donuts, since I think it’d only traverse a continuous perimeter.
Related Questions
- Although textures are visible at daytime/ in summer, some presumably textured polygons are colored at night or in Winter/ Fall/ Spring. What is going on?
- Does anybody know how to detect small gaps between polygons and holes in polygons in a feature class and store them in another feature class?
- How do I stop entering vertices for polylines and polygons?
